Hilbert Bases and the Facets of Special Knapsack Polytopes

DOI10.1287/moor.21.4.886zbMath0867.90083OpenAlexW2073115205MaRDI QIDQ4332256

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

Hilbert basis0/1 knapsack polytopecone of exchange vectors

Mathematics Subject Classification ID

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

Related Items

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