An exact algorithm for large multiple knapsack problems
David Pisinger · European Journal of Operational Research · 1999
Cited by 185 works. doi:10.1016/s0377-2217(98)00120-9
Authors
References
- Dynamic Programming
- Discrete-Variable Extremum Problems
- Knapsack Problems: Algorithms and Computer Implementations
- Computing Partitions with Applications to the Knapsack Problem
- An Algorithm for Large Zero-One Knapsack Problems
- A Minimal Algorithm for the 0-1 Knapsack Problem
- An algorithm for 0‐1 multiple‐knapsack problems
- Solution of the zero-one multiple knapsack problem
- A Bound and Bound algorithm for the zero-one multiple knapsack problem
- The One Dimensional Cutting Stock Problem Using Two Objectives