Integral decomposition of polyhedra and some applications in mixed integer programming

DOI10.1007/s10107-002-0315-0zbMath1030.90070OpenAlexW2036991007MaRDI QIDQ1411609

Robert Weismantel, Matthias Köppe, Martin Henk

Publication date: 29 October 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-002-0315-0

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

Approximating multidimensional subset sum and Minkowski decomposition of polygons, Compact representations of all members of an independence system