Additional Key Words and Phrases: partitions, knapsack problem, dynamic programming, integer optimization
Selected papers that cite this one
- Afonso Ferreira and John Michael Robson. Fast and scalable parallel algorithms for knapsack-like problems. Journal of Parallel and Distributed Computing, 39(1):1-13, 25 November 1996.
- Sartaj Sahni. Approximate algorithms for the 0/1 knapsack problem. Journal of the ACM, 22(1):115-124, January 1975.
Selected references
- Stephen A. Cook. Path systems and language recognition. In Conference Record of Second Annual ACM Symposium on Theory of Computing, pages 70-72, Northampton, Massachusetts, 4-6 May 1970.