Approximate algorithms for some generalized knapsack problems
Open Access
- 1 December 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 3 (3) , 293-304
- https://doi.org/10.1016/0304-3975(76)90048-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Storage cost considerations in secondary index selectionInternational Journal of Parallel Programming, 1975
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975