On facets of knapsack equality polytopes

DOI10.1023/A:1022624122832zbMath0886.90102MaRDI QIDQ1367796

Bernhard Rupp

Publication date: 19 April 1998

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

integer programmingbranch-and-boundknapsack polytopespolyhedral theory

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Boolean programming (90C09)

Related Items (1)

Knapsack polytopes: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• On the \(0/1\) knapsack polytope
• Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut
• Easily Computable Facets of the Knapsack Polytope
• Computing low-capacity 0–1 knapsack polytopes
• 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

This page was built for publication: On facets of knapsack equality polytopes