A new fully polynomial approximation scheme for the knapsack problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1444, Issue , 1998, Pages 123-134

  Kellerer, Hans ^a   Pferschy, Ulrich ^a  

^a UNIVERSITY OF GRAZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

0-1 KNAPSACK PROBLEM; APPROXIMATION SCHEME; KNAPSACK PROBLEMS; NEW APPROACHES; RUNNING TIME; SPACE REQUIREMENTS;

POLYNOMIAL APPROXIMATION;

EID: 84958974567     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0053969     Document Type: Conference Paper

References (6)

1. A. Caprara, H. Kellerer, U. Pferschy, D. Pisinger, “Approximation algorithms for knapsack problems with cardinality constraints”, Technical Report 01/1998, Faculty of Economics, University Graz, submitted.
2. H. Kellerer, R. Mansini, U. Pferschy, M.G. Speranza, “An efficient fully polynomial approximation scheme for the subset-sum problem”, Technical Report 14/1997, Fac. of Economics, Univ. Graz, submitted, see also Proceedings of the 8th ISAAC Symposium, Springer Lecture Notes in Computer Science 1350, 394-403, 1997.
3. E. Lawler, “Fast approximation algorithms for knapsack problems”, Mathematics of Operations Research 4, 339-356, 1979.
4. M.J. Magazine, O. Oguz, “A fully polynomial approximation algorithm for the 0-1 knapsack problem”, European Journal of Operational Research, 8, 270-273, 1981.
5. S. Martello, P. Toth, Knapsack Problems, J. Wiley & Sons, 1990.
6. D. Pisinger, P. Toth, “Knapsack Problems”, in D.Z. Du, P. Pardalos (eds.) Handbook of Combinatorial Optimization, Kluwer, Norwell, 1-89, 1997.