Heuristic algorithms for the multiple knapsack problem
- 1 June 1981
- journal article
- Published by Springer Science and Business Media LLC in Computing
- Vol. 27 (2), 93-112
- https://doi.org/10.1007/bf02243544
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A Bound and Bound algorithm for the zero-one multiple knapsack problemDiscrete Applied Mathematics, 1981
- Solution of the zero-one multiple knapsack problemEuropean Journal of Operational Research, 1980
- A heuristic routine for solving large loading problemsNaval Research Logistics Quarterly, 1979
- An algorithm for 0‐1 multiple‐knapsack problemsNaval Research Logistics Quarterly, 1978
- Algorithm 37 Algorithm for the solution of the 0–1 single knapsack problemComputing, 1978