Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4959877 | European Journal of Operational Research | 2017 | 14 Pages |
Abstract
We consider the 0/1 Collapsing Knapsack Problem (CKP) and a generalization involving more than a capacity constraint (M-CKP). We propose a novel ILP formulation and a problem reduction procedure together with an exact approach. The proposed approach compares favorably to the methods available in the literature and manages to solve to optimality very large size instances particularly for CKP and 2-CKP.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Federico Della Croce, Fabio Salassa, Rosario Scatamacchia,