Minimal inequalities for an infinite relaxation of integer programs
Basu, A., Conforti, M., Cornuéjols, G. & Zambelli, G.
(2010).
Minimal inequalities for an infinite relaxation of integer programs.
SIAM Journal on Discrete Mathematics,
24(1), 158-168.
https://doi.org/10.1137/090756375
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn. This result extends a theorem of Lovasz characterizing maximal lattice-free convex sets. We then consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal S-free convex sets.
| Item Type | Article |
|---|---|
| Copyright holders | © 2010 Society for Industrial and Applied Mathematics |
| Departments | LSE > Academic Departments > Management |
| DOI | 10.1137/090756375 |
| Date Deposited | 24 Jan 2011 |
| URI | https://researchonline.lse.ac.uk/id/eprint/31581 |
Explore Further
- https://www.scopus.com/pages/publications/77952487444 (Scopus publication)
- http://www.siam.org/journals/sidma.php (Official URL)