On integer polytopes with few nonzero vertices

DOI10.1016/j.orl.2012.11.007zbMath1266.90129OpenAlexW2083109349MaRDI QIDQ2376738

Alberto Caprara, Gábor Maróti, Valentina Cacchiani, Paolo Toth

Publication date: 24 June 2013

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2012.11.007

zbMATH Keywords

convex hullknapsacktrain unit assignment

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (4)

Local convex hulls for a special class of integer multicommodity flow problems ⋮ Solving a real-world train-unit assignment problem ⋮ Convex hulls of superincreasing knapsacks and lexicographic orderings ⋮ Geometric proofs for convex hull defining formulations

This page was built for publication: On integer polytopes with few nonzero vertices