An algorithm for the solution of the 0–1 knapsack problem
- 1 September 1982
- journal article
- Published by Springer Nature in Computing
- Vol. 28 (3) , 269-287
- https://doi.org/10.1007/bf02241754
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- Fast Approximation Algorithms for Knapsack ProblemsMathematics of Operations Research, 1979
- Implementing Quicksort programsCommunications of the ACM, 1978
- Note—On “An Efficient Algorithm for the 0-1 Knapsack Problem, by Robert M. Nauss”Management Science, 1978
- A Direct Descent Binary Knapsack AlgorithmJournal of the ACM, 1978
- Algorithm 37 Algorithm for the solution of the 0–1 single knapsack problemComputing, 1978
- Resolution of the 0–1 knapsack problem: Comparison of methodsMathematical Programming, 1975
- A Branch Search Algorithm for the Knapsack ProblemManagement Science, 1970