Minimal Inequalities for an Infinite Relaxation of Integer Progra.pdf.pdf' (195.61 kB)
Download fileMinimal Inequalities for an Infinite Relaxation of Integer Programs
journal contribution
posted on 2008-10-01, 00:00 authored by Amitabh Basu, Michele Conforti, Gerard CornuejolsGerard Cornuejols, Giacomo ZambelliWe 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 Lovász
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.