Computing Partitions with Applications to the Knapsack Problem
- 1 April 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 21 (2) , 277-292
- https://doi.org/10.1145/321812.321823
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- A Branch and Bound Algorithm for the Knapsack ProblemManagement Science, 1967
- The Theory and Computation of Knapsack FunctionsOperations Research, 1966
- Multistage Cutting Stock Problems of Two and More DimensionsOperations Research, 1965