The Sequential Knapsack Polytope
From MaRDI portal
Publication:4389190
DOI10.1137/S1052623495285217zbMath0911.90262OpenAlexW1985862636MaRDI QIDQ4389190
Robert Weismantel, Yves Pochet
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
integer programmingknapsack problemseparationlinear programming formulationknapsack polytopeconvex hull of all solutions
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10)
Related Items
Knapsack polytopes: a survey, Lexicographical order in integer programming, A new upper bound for the multiple knapsack problem, The Mixing Set with Divisible Capacities, Convex hulls of superincreasing knapsacks and lexicographic orderings, Compact formulations as a union of polyhedra, Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem, A polynomial algorithm for the multiple knapsack problem with divisible item sizes, Cover and pack inequalities for (mixed) integer programming, Continuous knapsack sets with divisible capacities
