Solution of the zero-one multiple knapsack problem
- 30 April 1980
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 4 (4), 276-283
- https://doi.org/10.1016/0377-2217(80)90112-5
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An algorithm for 0‐1 multiple‐knapsack problemsNaval Research Logistics Quarterly, 1978
- An upper bound for the zero-one knapsack problem and a branch and bound algorithmEuropean Journal of Operational Research, 1977
- An Algorithm for the Solution of 0-1 Loading ProblemsOperations Research, 1975
- Merging and Sorting Applied to the Zero-One Knapsack ProblemOperations Research, 1975
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974