An expanding-core algorithm for the exact 0–1 knapsack problem
- 16 November 1995
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 87 (1), 175-187
- https://doi.org/10.1016/0377-2217(94)00013-3
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A New Algorithm for the 0-1 Knapsack ProblemManagement Science, 1988
- Exact methods for the knapsack problem and its generalizationsEuropean Journal of Operational Research, 1987
- An algorithm for the solution of the 0–1 knapsack problemComputing, 1982
- On the complexity of integer programmingJournal of the ACM, 1981
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- Reduction Algorithm for Zero-One Single Knapsack ProblemsManagement Science, 1973
- QuicksortThe Computer Journal, 1962
- Discrete-Variable Extremum ProblemsOperations Research, 1957