A fully polynomial approximation algorithm for the 0–1 knapsack problem
- 30 November 1981
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 8 (3) , 270-273
- https://doi.org/10.1016/0377-2217(81)90175-2
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- An algorithm for the 0/1 Knapsack problemMathematical Programming, 1978
- An algorithm and efficient data structures for the binary knapsack problemEuropean Journal of Operational Research, 1978
- An Efficient Algorithm for the 0-1 Knapsack ProblemManagement Science, 1976
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969