
Open access
Date
2014-04Type
- Journal Article
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. Show more
Permanent link
https://doi.org/10.3929/ethz-b-000075187Publication status
publishedExternal links
Journal / series
Mathematical ProgrammingVolume
Pages / Article No.
Publisher
SpringerSubject
Mixed integer programming; Disjunctive programming; Polyhedral relaxationsOrganisational unit
03873 - Weismantel, Robert / Weismantel, Robert
Notes
It was possible to publish this article open access thanks to a Swiss National Licence with the publisher.More
Show all metadata