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
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.
|Additional Information:||© 2010 Society for Industrial and Applied Mathematics|
|Uncontrolled Keywords:||integer programming, cutting planes, maximal lattice-free convex sets|
|Library of Congress subject classification:||Q Science > QA Mathematics|
|Sets:||Departments > Management|
Actions (login required)
|Record administration - authorised staff only|