Un algoritmo misto per il problema dell'assegnazione pluridimensionale

  • Paola Olivo


In questa nota si studia il problema di assegnazione 3-dimensionale con una estensionek-dimensionale, e si propone un algoritmo risolutivo misto derivato dall'algoritmo Ungherese e dalle tecniche «branch and bound».


The extension of the classical assignment problem tok-dimension is discussed, and solved in the casek=3. The problem is solved using an algorithm that mixes the ≪hungarian method≫ and the ≪branch and bound≫ technique.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Burkard R. E., Derigs U.,Assignment and Matching Problems. Solution Methods with Fortran-programs. Lecture Notes in Economics and Math. System, 148 (1980), Springer Verlag.Google Scholar
  2. [2]
    Frieze A. M.,A formutation of the 3-dimensional assignment problem. Mathematical Programming, 7 (1974), pp. 376–379.CrossRefGoogle Scholar
  3. [3]
    Kuhn H. W.,The hungarian method for the assignment problem. Naval Res. Log. Quart., 2 (1955).Google Scholar
  4. [4]
    Little, J. D. C., Murthy K. G., Sweeney D. W., Karel C.,An algorithm for the traveling salesman problem. Operation Research, 11 (1963), pp. 972–989.Google Scholar
  5. [5]
    Muracchini L.,Programmazione matematica. UTET (1969).Google Scholar
  6. [6]
    Papadimitriou C. H.,Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall (1982).Google Scholar
  7. [7]
    Pierskalla W. P.,The multidimensional assignment problem. Operation Research, 16 (1968), pp. 422–431.Google Scholar

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • Paola Olivo
    • 1
  1. 1.Istituto di Matematica Generate e Finanziaria, Facoltà di Economia e CommercioUniversità di BolognaBolognaItalia

Personalised recommendations