The Sequential Knapsack Polytope

DOI10.1137/S1052623495285217MaRDI QIDQ4389190zbMATH OpenOpenAlexFDO

Authors Yves Pochet, Robert Weismantel

Publication date 12 May 1998

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623495285217

zbMATH Keywords

convex hull of all solutionsinteger programmingknapsack polytopeknapsack problemlinear programming formulationseparation

Mathematics Subject Classification ID

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

Recommendations

• On the \(0/1\) knapsack polytope
• Complete description of a class of knapsack polytopes.
• On the facets of the mixed-integer knapsack polyhedron
• Valid inequalities, cutting planes and integrality of the knapsack polytope
• Hilbert Bases and the Facets of Special Knapsack Polytopes

Cited in

(12)

• Complete description of a class of knapsack polytopes.
• Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
• Lexicographical order in integer programming
• Continuous knapsack sets with divisible capacities
• A new upper bound for the multiple knapsack problem
• The Mixing Set with Divisible Capacities
• Hilbert Bases and the Facets of Special Knapsack Polytopes
• Cover and pack inequalities for (mixed) integer programming
• Knapsack polytopes: a survey
• Convex hulls of superincreasing knapsacks and lexicographic orderings
• Compact formulations as a union of polyhedra
• A polynomial algorithm for the multiple knapsack problem with divisible item sizes

This page was built for publication: The Sequential Knapsack Polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389190)