Maximal Lattice-Free Convex Sets in Linear Subspaces
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli · Figshare · 2018
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