Maximal Lattice-Free Convex Sets in Linear Subspaces
journal contributionposted on 01.01.2005 by Amitabh Basu, Michele Conforti, Gerard Cornuejols, Giacomo Zambelli
Any type of content formally published in an academic journal, usually following a peer-review process.
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