On integer polytopes with few nonzero vertices

DOI10.1016/J.ORL.2012.11.007MaRDI QIDQ2376738zbMATH OpenOpenAlexFDO

Authors Valentina Cacchiani, Alberto Caprara, Gábor Maróti, 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)

Recommendations

• The Integer Knapsack Cover Polyhedron
• On facets of knapsack equality polytopes
• Polyhedral properties for the intersection of two knapsacks
• Knapsack polytopes: a survey
• On the multiple integer knapsack polyhedra

Cited in

(7)

• Geometric proofs for convex hull defining formulations
• Solving a real-world train-unit assignment problem
• Local convex hulls for a special class of integer multicommodity flow problems
• scientific article; zbMATH DE number 5799883 (Why is no real title available?)
• Some Applications of Affine Gale Diagrams to Polytopes with Few Vertices
• scientific article; zbMATH DE number 1187141 (Why is no real title available?)
• Convex hulls of superincreasing knapsacks and lexicographic orderings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376738)