Some tactics for 0-1 programming
Harvey J. Greenberg, James E. Kalan · ACM SIGMAP Bulletin · 1973
This paper describes several tactics (including batch branching) for employing a directed tree search strategy to find a binary vector slated to optimize a linear function. Certain tactics are especially useful when interfacing with an LP system to guide the tree search.