Computing low-capacity 0–1 knapsack polytopes

DOI10.1007/BF01917116zbMath0494.90052MaRDI QIDQ3958269

Peter L. Hammer, Uri N. Peled

Publication date: 1982

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

polarity0-1 variablescomputation of low-capacity 0-1 knapsack polytopesfacets of the convex hull of the solutionslinear inequality with positive integral coefficients

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09) Polytopes and polyhedra (52Bxx)

Related Items

Knapsack polytopes: a survey, On facets of knapsack equality polytopes, On cutting-plane proofs in combinatorial optimization

Cites Work

• Unnamed Item
• Anti-blocking polyhedra
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Coefficient reduction for inequalities in 0–1 variables
• Technical Note—A Note on Zero-One Programming
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• The Role of Master Polytopes in the Unit Cube