Facet defining inequalities for the dichotomous knapsack problem

DOI10.1016/0167-6377(90)90036-5zbMath0697.90053OpenAlexW1989282281MaRDI QIDQ911989

Elsie Sterbin Gottlieb

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0167-6377(90)90036-5

zbMATH Keywords

linear relaxationfacet defining inequalitiesdichotomous knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09)

Cites Work

• Unnamed Item
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• (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
• Bottleneck extrema

This page was built for publication: Facet defining inequalities for the dichotomous knapsack problem