Basu, Amitabh Conforti, Michele Cornuejols, Gerard Zambelli, Giacomo Maximal Lattice-Free Convex Sets in Linear Subspaces 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 R<sup>n</sup> Business;Management 2005-01-01
    https://kilthub.cmu.edu/articles/journal_contribution/Maximal_Lattice-Free_Convex_Sets_in_Linear_Subspaces/6706727
10.1184/R1/6706727.v1