An algorithm and efficient data structures for the binary knapsack problem
- 30 November 1978
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 2 (6) , 420-428
- https://doi.org/10.1016/0377-2217(78)90137-6
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Merging and Sorting Applied to the Zero-One Knapsack ProblemOperations Research, 1975
- Resolution of the 0–1 knapsack problem: Comparison of methodsMathematical Programming, 1975
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Reduction Algorithm for Zero-One Single Knapsack ProblemsManagement Science, 1973
- Mixed-integer Algorithms for the (0,1) Knapsack ProblemIBM Journal of Research and Development, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- An Enumeration Algorithm for Knapsack ProblemsOperations Research, 1970
- A Branch Search Algorithm for the Knapsack ProblemManagement Science, 1970
- A Branch and Bound Algorithm for the Knapsack ProblemManagement Science, 1967