- Journal Article
Rights / licenseIn Copyright - Non-Commercial Use Permitted
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. Show more
Journal / seriesMathematical Programming
Pages / Article No.
SubjectMixed integer programming; Disjunctive programming; Polyhedral relaxations
Organisational unit03873 - Weismantel, Robert / Weismantel, Robert
NotesIt was possible to publish this article open access thanks to a Swiss National Licence with the publisher.
MoreShow all metadata