On the Sequential Multiknapsack polytope

MaRDI QIDQ6252276zbMATH OpenFDO

Authors Paolo Detti

Publication date 12 June 2014

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Abstract: The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the integer solutions are presented. More precisely, it is shown that a new formulation of the problem allows to generate a decomposition approach for enumerating all optimal solutions of the problem. Such a decomposition approach is used for finding the inequalities (defined by an inductive scheme) describing the Sequential Multiple Knapsack polytope.

This page was built for publication: On the Sequential Multiknapsack polytope

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