An Algorithm for the Knapsack Problem
- 1 March 1983
- journal article
- Published by Taylor & Francis in IIE Transactions
- Vol. 15 (1) , 31-36
- https://doi.org/10.1080/05695558308974610
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- Computational results with a branch‐and‐bound algorithm for the general knapsack problemNaval Research Logistics Quarterly, 1979
- An Efficient Algorithm for the 0-1 Knapsack ProblemManagement Science, 1976
- The knapsack problem: A surveyNaval Research Logistics Quarterly, 1975
- Reduction Algorithm for Zero-One Single Knapsack ProblemsManagement Science, 1973
- An Enumeration Algorithm for Knapsack ProblemsOperations Research, 1970
- Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]Communications of the ACM, 1969
- A Finite Renewal Algorithm for the Knapsack and Turnpike ModelsOperations Research, 1967
- The Theory and Computation of Knapsack FunctionsOperations Research, 1966
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963