Approximation algorithms for knapsack problems with cardinality constraints

European Journal of Operational Research

Volumn 123, Issue 2, 2000, Pages 333-345

  Caprara, Alberto ^a   Kellerer, Hans ^b   Pferschy, Ulrich ^b   Pisinger, David ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF GRAZ   (Austria)

^c UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

CARDINALITY CONSTRAINTS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEME; KNAPSACK PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEME; REAL LIFE CUTTING STOCK PROBLEMS;

ALGORITHMS;

EID: 0033879594     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00261-1     Document Type: Article

References (23)

1. N. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, R.E. Tarjan, Time bounds for selection, Journal of Computer System and Science 7 (1973) 448-461.
2. R.G. Downey, M.R. Fellows, Fixed-parameter tractability and completeness I: Basic results, SIAM Journal on Computing 24 (1995) 203-225.
3. R.G. Downey, M.R. Fellows, Fixed-parameter tractability and completeness II: On completeness for W[1], Theoretical Computer Science 141 (1995) 109-131.
4. M. Fischetti, A new linear storage polynomial-time approximation scheme for the subset-sum problem, Discrete Applied Mathematics 26 (1990) 61-77.
5. A.M. Frieze, M.R.B. Clarke, Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worstase and probabilistic analyses, European Journal of Operational Research 15 (1984) 100-109.
6. G.V. Gens, E.V. Levner, Fast approximation algorithms for knapsack type problems, in: K. Iracki, K. Malinowski, S. Walukiewicz (Eds.), Optimization Techniques, Part 2 Lecture Notes in Control and Information Sciences, vol. 23, Springer, Berlin, 1980, pp. 185-194.
7. O.H. Ibarra, C.E. Kim, Fast approximation algorithms for the knapsack and sum of subset problems, Journal of the ACM 22 (1975) 463-468.
8. H. Kellerer, U. Pferschy, A New Fully Polynomial Approximation Scheme for the Knapsack Problem, Journal of Combinatorial Optimization 3 (1999) 59-71.
9. H. Kellerer, R. Mansini, U. Pferschy, M.G. Speranza, An efficient fully polynomial approximation scheme for the subset-sum problem, Technical Report, Faculty of Economics, University Graz, submitted,
10. see also Proceedings of the 8th ISAAC Symposium, Springer Lecture Notes in Computer Science 1350 (1997) 394-403.
11. B. Korte, R. Schrader, On the existence of fast approximation schemes, in: O.L. Mangasarian, R.R. Meyer, S.M. Robinson (Eds.), Nonlinear Programming 4, Aademic Press, 1981, pp. 415-437.
12. E.G. Lawler, Fast approximation algorithms for knapsack problems, Mathematics of Operations Research 4 (1979) 339-356.
13. M.J. Magazine, O. Oguz, A fully polynomial approximation algorithm for the 0-1 knapsack problem, European Journal of Operational Research 8 (1981) 270-273.
14. S. Martello, P. Toth, Knapsack Problems, Wiley, Chichester, 1990.
15. N. Megiddo, A. Tamir, Linear time algorithms for some separable quadratic programming problems, Operations Research Letters 13 (1993) 203-211.
16. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
17. O. Oguz, M.J. Magazine, A polynomial time approximation algorithm for the multidimensional knapsack problem, Working Paper, University of Waterloo, Waterloo, Ont., 1980.
18. U. Pferschy, D. Pisinger, G.J. Woeginger, Simple but efficient approaches for the collapsing knapsack problem, Discrete Applied Mathematics 77 (1997) 271-280.
19. D. Pisinger, A fast algorithm for strongly correlated knapsack problems, Discrete Applied Mathematics 89 (1998) 197-212.
20. D. Pisinger, P. Toth, Knapsack problems, in: D.Z. Du, P. Pardalos (Eds.), Handbook of Combinatorial Optimization, Kluwer, Norwell, MA, 1998, pp. 1-89.
21. M.E. Posner, M. Guignard, The collapsing 0-1 knapsack problem, Mathematical Programming 15 (1978) 155-161.
22. S. Sahni, Approximate algorithms for the knapsack problem, Journal of the ACM 22 (1975) 115-124.
23. F. Vanderbeck, Computational study of a column generation algorithm for bin packing and cutting stock problems, TR-14/96, University of Cambridge, 1996.