Improved Strategies for Branching on General Disjunctions

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, on instances that contain both integer and continuous variables the number of nodes in the enumeration tree is reduced by more than a factor of two, and 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

• Type: Conference
• Year: 2009
• Where: COLOGNETWENTE
• Authors: Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini
• Keywords: COLOGNETWENTE 2007, COLOGNETWENTE 2009, Fewer Nodes, Mixed-Integer Linear Programs, Test Instances