Branch and bound algorithms for Mixed-Integer Linear Programming (MILP) almost universally branch on a single variable to create disjunctions. General linear expressions involving multiple variables are another option for branching disjunctions, but are not used for two main reasons: (i) descendent LPs tend to solve more slowly because of the added constraints, so the overall solution time is increased, and (ii) it is difficult to quickly find an effective general disjunction. We study the use of general disjunctions to reach the first MILP-feasible solution quickly, showing for the first time that general disjunctions can provide speed improvements for hard MILP models. The speed-up is due to new and efficient ways to (i) trigger the inclusion of a general disjunction only when it is likely to be beneficial, and (ii) construct effective general disjunctions very quickly. Our empirical results show performance improvements versus a state of the art commercial MILP solver.

Additional Metadata
Keywords Mixed integer linear programming General disjunctions Branching
Persistent URL dx.doi.org/10.1016/j.cor.2013.03.001
Journal Computers and Operations Research
Citation
Mahmoud, H. (Hanan), & Chinneck, J. (2013). Achieving MILP feasibility quickly using general disjunctions. Computers and Operations Research, 40(8), 2094–2102. doi:10.1016/j.cor.2013.03.001