Name
Abstract | ||
|---|---|---|
•A new ILP formulation is presented for the 0–1 collapsing knapsack problem.•An efficient reduction procedure is proposed.•A branching scheme exploiting the structure of the ILP formulation is provided.•An exact approach is given that solves to optimality large size instances.•The approach is extended to the multi-dimensional collapsing knapsack problem. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.ejor.2016.12.009 | European Journal of Operational Research |
Keywords | Field | DocType |
Branch and Bound,Collapsing Knapsack Problem,0–1 Programming,Exact algorithm | Branch and bound,Mathematical optimization,Exact algorithm,Change-making problem,Continuous knapsack problem,Cutting stock problem,Knapsack problem,Reduction procedure,Mathematics | Journal |
Volume | Issue | ISSN |
260 | 1 | 0377-2217 |
Citations | PageRank | References |
4 | 0.44 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Federico Della Croce | 1 | 399 | 41.60 |
| Fabio Salassa | 2 | 56 | 9.79 |
| Rosario Scatamacchia | 3 | 58 | 7.66 |