Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Optimization Année : 2005

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

Résumé

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.

Dates et versions

hal-00421750 , version 1 (03-10-2009)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More