Improved Strategies for Branching on General Disjunctions.pdf.pdf' (48.16 kB)
Download fileImproved Strategies for Branching on General Disjunctions
journal contribution
posted on 2009-03-16, 00:00 authored by Gerard CornuejolsGerard Cornuejols, Leo Liberti, Giacomo NanniciniWithin the context of solving Mixed-Integer Linear Programs by a Branch-and-
Cut 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