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
Full text not available from this repository.
Identification Number: 10.1137/090756375
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 |
| Divisions: | Management |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 24 Jan 2011 09:49 |
| Last Modified: | 11 Dec 2024 23:44 |
| URI: | http://eprints.lse.ac.uk/id/eprint/31581 |
Actions (login required)
 |
View Item |
