A PTAS for the Multiple Subset Sum Problem with different knapsack capacities

Information Processing Letters

Volumn 73, Issue 3-4, 2000, Pages 111-118

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

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF GRAZ   (Austria)

Author keywords

Algorithms; Multiple Subset Sum problem; PTAS

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; THEOREM PROVING;

MULTIPLE KNAPSACK PROBLEMS; MULTIPLE SUBSET SUM PROBLEMS (MSSP);

SET THEORY;

EID: 0033904599     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(00)00010-7     Document Type: Article

References (5)

1. A. Caprara, H. Kellerer, U. Pferschy, The Multiple Subset Sum Problem, Technical Report, Faculty of Economics, University of Graz, December 1998.
2. M. Dawande, J. Kalagnanam, P. Keskinocak, R. Ravi, F.S. Salman, Approximation algorithms for the multiple knapsack problem with assignment restrictions, IBM Research Report RC 21331, IBM Research Division, T.J. Watson Research Center, Yorktown Heights, NY, 1998.
3. W. Fernandez de la Vega, G.S. Lueker, Bin packing can be solved within 1 + ε in linear time, Combinatorica 1 (1981) 349-355.
4. H. Kellerer, A polynomial approximation scheme for the multiple knapsack problem, in: Proc. APPROX 99, Lecture Notes in Computer Science, Springer, Berlin, 1999.
5. H.W. Lenstra, Integer programming with a fixed number of variables, Math. Oper. Res. 8 (1983) 538-548.