Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on the majority of our test instances, this approach enumerates fewer nodes than traditional branching. On average, the number of nodes in the enumeration tree is reduced by a factor two, while computing time is comparable. On a few instances, the improvements are of several orders of magnitude in both number of nodes and computing time. Keywords integer programming · branch and bound · split disjunctions
REF confirmed that general disjunctions can reduce the number of nodes in the enumeration tree by a factor of more than two.
Improved strategies for branching on general disjunctions
CTW
Mathematics Computer Science