Abstract
We describe families of inequalities for 0-1 mixed-integer programming problems that are obtained by lifting cover and packing inequalities. We show that these inequalities can be separated from single rows of the simplex tableaux of their linear programming relaxations. We present the results of a computational study comparing their performance with that of Gomory mixed-integer cuts on a collection of MIPLIB and randomly generated 0-1 mixed-integer programs. The computational study shows that these cuts yield better results than Gomory mixed-integer cuts.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 416-424 |
| Number of pages | 9 |
| Journal | INFORMS Journal on Computing |
| Volume | 23 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jun 2011 |
| Externally published | Yes |
Keywords
- Cutting planes
- Lifting
- Mixed-integer programming
- Simplex tableaux cuts
Fingerprint
Dive into the research topics of 'Lifted tableaux inequalities for 0-1 mixed-integer programs: A computational study'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS