| Affiliation: | 1.Dipartimento di Matematica Pura ed Applicata,Universitá degli Studi di Padova,Padova,Italy;2.IFOR, Department of Mathematics,ETH Zürich,Zürich,Switzerland |
| Abstract: | Given a polyhedron (L) with (h) facets, whose interior contains no integral points, and a polyhedron (P), recent work in integer programming has focused on characterizing the convex hull of (P) minus the interior of (L). We show that to obtain such a characterization it suffices to consider all relaxations of (P) defined by at most (n(h-1)) among the inequalities defining (P). This extends a result by Andersen, Cornuéjols, and Li. |
