Learning Generalized Strong Branching for Set Covering, Set Packing, and 0-1 Knapsack Problems
Branching on a set of variables, rather than on a single variable, can give tighter bounds at the child nodes and can result in smaller search trees. However, selecting a good set of variables to branch on is even more challenging than selecting a good single variable to branch on. Generalized strong branching extends the … Read more