Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

Abstract : Various techniques for building relaxations and generating valid inequalities for pure or mixed integer programming problems without special structure are reviewed and compared computationally. Besides classical techniques such as Gomory cuts, Mixed Integer Rounding cuts, lift-and-project and reformulation–linearization techniques, a new variant is also investigated: the use of the relaxation corresponding to the intersection of simple disjunction polyhedra (i.e. the so-called elementary closure of lift-and-project cuts). Systematic comparative computational results are reported on series of test problems including multidimensional knapsack problems (MKP) and MIPLIB test problems. From the results obtained, the relaxation based on the elementary closure of lift-and-project cuts appears to be one of the most promising.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00421750
Contributor : Pierre Bonami <>
Submitted on : Saturday, October 3, 2009 - 11:39:57 AM
Last modification on : Friday, May 24, 2019 - 5:25:41 PM

Links full text

Identifiers

Citation

Pierre Bonami, Michel Minoux. Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation. Discrete Optimization, Elsevier, 2005, 2 (4), pp.288-307. ⟨10.1016/j.disopt.2005.08.006⟩. ⟨hal-00421750⟩

Share

Metrics

Record views

191