Approximate Algorithms for the 0/1 Knapsack Problem
- 1 January 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 22 (1) , 115-124
- https://doi.org/10.1145/321864.321873
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- Discrete Dynamic Programming and Capital AllocationManagement Science, 1969