Basu, Amitabh , Conforti, Michele, Cornuéjols, Gérard and Zambelli, Giacomo (2010) Minimal inequalities for an infinite relaxation of integer programs. SIAM Journal on Discrete Mathematics, 24 (1). pp. 158-168. ISSN 0895-4801
Abstract
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 |
|---|---|
| Official URL: | http://www.siam.org/journals/sidma.php |
| Additional Information: | © 2010 Society for Industrial and Applied Mathematics |
| Library of Congress subject classification: | Q Science > QA Mathematics |
| Sets: | Departments > Management |
| Date Deposited: | 24 Jan 2011 09:49 |
| URL: | http://eprints.lse.ac.uk/31581/ |
Actions (login required)
 |
Record administration - authorised staff only |
