The multiple subset sum problem

SIAM Journal on Optimization

Volumn 11, Issue 2, 2000, Pages 308-319

  Caprara, Alberto ^a   Kellerer, Hans ^b   Pferschy, Ulrich ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF GRAZ   (Austria)

Author keywords

Approximation scheme; Knapsack problem; Multiple subset sum problem

Indexed keywords

EID: 0034353730     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623498348481     Document Type: Article

References (10)

1. A. CAPRARA, H. KELLERER, AND U. PFERSCHY, The Multiple Subset Sum Problem, Technical Report 12/1998, Faculty of Economics, University of Graz, Graz, Austria, 1998.
2. C. CHEKURI AND S. KHANNA, On multi-dimensional packing problems, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), 1999.
3. J. CSIRIK, H. KELLERER, AND G.J. WOEGINGER, The exact LPT method for maximizing the minimum completion time, Oper. Res. Lett., 11 (1992), pp. 281-287.
4. W. FERNANDEZ DE LA VEGA AND G.S. LUEKER, Bin packing can be solved within 1 + ε in linear time, Combinatorica, 1 (1981), pp. 349-355.
5. M.R. GAREY AND D.S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
6. N. KARMARKAR AND R.M. KARP, An efficient approximation scheme for the one-dimensional bin packing problem, in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1982, pp. 312-320.
7. H.W. LENSTRA, Integer programming with a fixed number of variables, Math. Oper. Res., 8 (1983), pp. 538-548.
8. S. MARTELLO AND P. TOTH, Knapsack Problems: Algorithms and Computer Implementations, John Wiley, Chichester, UK, 1990.
9. D. PISINGER AND P. TOTH, Knapsack problems, in Handbook of Combinatorial Optimization, D.Z. Du and P. Pardalos, eds., Kluwer Academic Publishers, Norwell, MA, 1998, pp. 1-89.
10. G. WIRSCHING, personal communication, Katholische Universität Eichstätt, 1998.