Hilbert Bases and the Facets of Special Knapsack Polytopes

DOI10.1287/MOOR.21.4.886MaRDI QIDQ4332256zbMATH OpenOpenAlexFDO

Authors Robert Weismantel

Publication date 13 February 1997

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/33947781bd24e827d077f494890f6f6f4581baf0

zbMATH Keywords

0/1 knapsack polytopecone of exchange vectorsHilbert basis

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10)

Recommendations

• Complete description of a class of knapsack polytopes.
• On the multiple integer knapsack polyhedra
• On the \(0/1\) knapsack polytope
• The Sequential Knapsack Polytope
• Knapsack polytopes: a survey

Cited in

(12)

• The height of minimal Hilbert bases
• Complete description of a class of knapsack polytopes.
• Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
• Description of 2-integer continuous knapsack polyhedra
• The Sequential Knapsack Polytope
• Coarse-grained entanglement classification through orthogonal arrays
• Test sets and inequalities for integer programs
• Cover and pack inequalities for (mixed) integer programming
• Knapsack polytopes: a survey
• Lifting two-integer knapsack inequalities
• Convex hulls of superincreasing knapsacks and lexicographic orderings
• Intermediate integer programming representations using value disjunctions

This page was built for publication: Hilbert Bases and the Facets of Special Knapsack Polytopes

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