Maximal lattice-free convex sets in linear subspaces
Basu, A., Conforti, M., Cornuéjols, G. & Zambelli, G.
(2010).
Maximal lattice-free convex sets in linear subspaces.
Mathematics of Operations Research,
35(3), 704-720.
https://doi.org/10.1287/moor.1100.0461
We consider a model that arises in integer programming and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also show that these sets are polyhedra. The latter result extends a theorem of Lovász characterizing maximal lattice-free convex sets in Rn.
| Item Type | Article |
|---|---|
| Copyright holders | © 2010 Informs |
| Departments | LSE > Academic Departments > Management |
| DOI | 10.1287/moor.1100.0461 |
| Date Deposited | 21 Jan 2011 |
| URI | https://researchonline.lse.ac.uk/id/eprint/31544 |
Explore Further
- https://www.scopus.com/pages/publications/77956638760 (Scopus publication)
- http://mor.journal.informs.org/ (Official URL)