Advertisement

Generalized assignment problems

  • Silvano Martello
  • Paolo Toth
Session 7: Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)

Abstract

We consider generalized assignment problems with different objective functions: min-sum, max-sum, min-max, max-min. We review transformations, bounds, approximation algorithms and exact algorithms. The results of extensive computational experiments are given.

Keywords

Approximation Algorithm Knapsack Problem Resource Requirement Lagrangian Relaxation Decision Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Carpaneto, S. Martello, P. Toth (1988). Algorithms and codes for the assignment problem. In B. Simeone, P. Toth, G. Gallo, F. Maffioli, S. Pallottino (eds.). Fortran Codes For Network Optimization, Annals of Operations Research 13, 193–223.Google Scholar
  2. A. De Maio, C. Roveda (1971). An all zero-one algorithm for a certain class of transportation problems. Operations Research 19, 1406–1418.Google Scholar
  3. M.L. Fisher (1981). The Lagrangian relaxation method for solving integer programming problems. Management Science 27, 1–18.Google Scholar
  4. M.L. Fisher, R. Jaikumar, L.N. VanWassenhove (1986). A multiplier adjustment method for the generalized assignment problem. Management Science 32, 1095–1103.Google Scholar
  5. E.S. Gottlieb, M.R. Rao (1990a). The generalized assignment problem: valid inequalities and facets. Mathematical Programming 46, 31–52.CrossRefGoogle Scholar
  6. E.S. Gottlieb, M.R. Rao (1990b). (1,k)-configuration facets for the generalized assignment problem. Mathematical Programming 46, 53–60.CrossRefGoogle Scholar
  7. M.M. Guignard, S. Kim (1987). Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Mathematical Programming 39, 215–228.Google Scholar
  8. M.M. Guignard, M.B. Rosenwein (1989). An improved dual based algorithm for the generalized assignment problem. Operations Research 37, 658–663.Google Scholar
  9. T.D. Klastorin (1979). An effective subgradient algorithm for the generalized assignment problem. Computers and Operations Research 6, 155–164.CrossRefGoogle Scholar
  10. N.W. Kuhn (1955). The hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 83–97.Google Scholar
  11. E.L. Lawler (1976). Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York.Google Scholar
  12. K. Jörnsten, M. NÄsberg (1986). A new Lagrangian relaxation approach to the generalized assignment problem. European Journal of Operational Research 27, 313–323.CrossRefGoogle Scholar
  13. S. Martello, P. Toth (1980). Solution of the zero-one multiple knapsack problem. European Journal of Operational Research 4, 276–283.CrossRefGoogle Scholar
  14. S. Martello, P. Toth (1981). An algorithm for the generalized assignment problem. In J.P. Brans (ed.), Operational Research'81, North-Holland, Amsterdam, 589–603.Google Scholar
  15. S. Martello, P. Toth (1990). Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester.Google Scholar
  16. S. Martello, P. Toth (1991).The bottleneck generalized assignment problem. Research report DEIS OR/5/91, University of Bologna.Google Scholar
  17. J.B. Mazzola (1989). Generalized assignment with nonlinear capacity interaction. Management Science 35, 923–941.Google Scholar
  18. J.B. Mazzola, A.W. Neebe (1988). Bottleneck generalized assignment problems. Engineering Costs and Production Economics 14, 61–65.Google Scholar
  19. G.T. Ross, R.M. Soland (1975). A branch and bound algorithm for the generalized assignment problem. Mathematical Programming 8, 91–103.CrossRefGoogle Scholar
  20. V. Srinivasan, G.L. Thompson (1973). An algorithm for assigning uses to sources in a special class of transportation problems. Operations Research 21, 284–295.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Silvano Martello
    • 1
  • Paolo Toth
    • 2
  1. 1.Dipartimento di InformaticaUnivcrsità di TorinoItaly
  2. 2.DEISUniversità di BolognaItaly

Personalised recommendations