Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses
- 1 January 1984
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 15 (1) , 100-109
- https://doi.org/10.1016/0377-2217(84)90053-5
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Khachiyan’s algorithm for linear programmingPublished by Springer Nature ,1981
- Approximate algorithms for some generalized knapsack problemsTheoretical Computer Science, 1976
- 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