Approximation schemes for the subset-sum problem: Survey and experimental analysis
- 1 October 1985
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 22 (1) , 56-69
- https://doi.org/10.1016/0377-2217(85)90115-8
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum ProblemManagement Science, 1984
- Worst-case analysis of greedy algorithms for the subset-sum problemMathematical Programming, 1984
- Probabilistic analysis of the subset-sum problemDiscrete Applied Mathematics, 1982
- Hard Knapsack ProblemsOperations Research, 1980
- Fast Approximation Algorithms for Knapsack ProblemsMathematics of Operations Research, 1979
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975