Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions

Journal of Combinatorial Optimization

Volumn 4, Issue 2, 2000, Pages 171-186

  Dawande, M ^a   Kalagnanam, J ^a   Keskinocak, P ^b   Ravi, R ^c   Salman, F S ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Multiple knapsack

Indexed keywords

EID: 0012790087     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009894503716     Document Type: Article

References (23)

1. A.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice Hall: New Jersey, 1993.
2. S. Arora and M. Sudan, "Improved low degree testing and its applications," in Proc. 29th ACM Annual Symp. on Theory of Computing, 1997, pp. 485-495.
3. A. Caprara, H. Kellerer, and U. Pferschy, "The multiple subset sum problem," Technical Report 12/1998, Faculty of Economics, University of Graz, 1998.
4. C. Chekuri, Personal communication, July 1999.
5. E.G. Coffman, M.R. Garey, and D.S. Johnson, "Approximation algorithms for bin-packing: An updated survey," in Algorithm Design for Computer System Design, G. Ausiello, M. Lucertini, and P. Serafini (Eds.), Springer-Verlag: Vienna, 1984, pp. 49-106.
6. E.G. Coffman, M.R. Garey, and D.S. Johnson, "Approximation algorithms for bin-packing: A survey," in Approximation Algorithms for NP-hard Problems, D.S. Hochbaum (Ed.), PWS Publishing Company: Boston, 1997, pp. 46-93.
7. M.W. Dawande and J.R. Kalagnanam, "The multiple knapsack problem with color constraints," Technical Report, RC21138, IBM T.J. Watson Research Center, Yorktown Heights, NY, 1998.
8. U. Feige, "A threshold of ln n for approximating set cover," in Proc. 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 314-318.
9. C.E. Ferreira, A. Martin, and R. Weismantel, "Solving multiple knapsack problems by cutting planes," SIAM J. Optimization, vol. 6, no. 3, pp. 858-877, 1996.
10. D.K. Friesen and M.A. Langston, "Variable sized bin packing," SIAM J. Computing, vol. 15, pp. 222-230, 1986.
11. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co.: San Francisco, 1979.
12. M.S. Hung and J.C. Fisk, "An algorithm for 0-1 multiple knapsack problems," Naval Res. Logist. Quarterly, vol. 24, pp. 571-579, 1978.
13. O.H. Ibarra and C.E. Kim, "Fast approximation for the knapsack and sum of subset problems," J. ACM, vol. 22, pp. 463-468, 1975.
14. J. Kalagnanam, M. Dawande, M. Trumbo, and H.S. Lee, "The surplus inventory matching problem in the process industry," Technical Report RC21071, IBM T.J. Watson Research Center, Yorktown Heights, NY, 1997.
15. V. Kann, "Maximum bounded 3-dimensional matching is MAX SNP-complete," Information Process. Lett., vol. 37, pp. 27-35, 1991.
16. R.M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (Eds.), Plenum Press: New York, 1972, pp. 85-103.
17. S. Martello and P. Toth, "Solution of the zero-one multiple knapsack problem," Euro. J. Oper. Res., vol. 4, pp. 322-329, 1980.
18. S. Martello and P. Toth, "A bound and bound algorithm for the zero-one multiple knapsack problem," Discrete Applied Math., vol. 3, pp. 275-288, 1981a.
19. S. Martello and P. Toth, "Heuristic algorithms for the multiple knapsack problem," Computing, vol. 27, pp. 93-112, 1981b.
20. S. Martello and P. Toth, Knapsack Problems, John Wiley and Sons, Ltd.: New York, 1990a.
21. S. Martello and P. Toth, "Lower bounds and reduction procedures for the bin packing problem," Discrete Applied Math., vol. 28, pp. 59-70, 1990b.
22. R. Raz and S. Safra, "A sub-constant error-probability low-degree test, and a sub-constant error-probability pcp characterization of NP," in Proc. 29th Annual ACM Symp. on Theory of Computing, 1997, pp. 314-318.
23. D. Shmoys and E. Tardos, "An approximation algorithm for the generalized assignment problem," Math. Programming, vol. 62, pp. 461-474, 1993.