Facets of the knapsack polytope derived from disjoint and overlapping index configurations

DOI10.1016/0167-6377(88)90073-9zbMath0645.90056OpenAlexW2036575931MaRDI QIDQ1103523

B. George

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90073-9

zbMATH Keywords

facets of the knapsack polytopeoverlapping minimal covers

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polytopes and polyhedra (52Bxx)

Related Items (4)

Knapsack polytopes: a survey ⋮ Facets and lifting procedures for the set covering polytope ⋮ Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes ⋮ A characterization of knapsacks with the max-flow--min-cut property

Cites Work

• Lifting the facets of zero–one polytopes
• (1,k)-configurations and facets for packing problems
• 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
• Facets of the Knapsack Polytope From Minimal Covers
• Covering, Packing and Knapsack Problems
• Unnamed Item

This page was built for publication: Facets of the knapsack polytope derived from disjoint and overlapping index configurations