Assignment by means of the «Branch and Bound» Algorithm

  • Jaime Gil-Aluja
Part of the Applied Optimization book series (APOP, volume 11)


A solution may also be found to the problem of assignment by using the Little algorithm(10), called <<branch and bound>>, although in this case its use is much simpler than in the case of obtaining a minimum Hamiltonian circuit(11). The use of this algorithm for dealing with the problem of assignment of n people to n tasks from a classic perspective, was suggested more than 25 years ago. Perhaps now, as a consequence of advances in management operating techniques in uncertainty, we can revive its interest to practical effect.


Human Resource Fuzzy Relation Interactive Management Hungarian Algorithm Classic Perspective 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Jaime Gil-Aluja
    • 1
  1. 1.Departament d’Economia i Organització d’EmpresesFacultat de Ciències Economiques i Empresarials de la Universität de BarcelonaBarcelonaSpain

Personalised recommendations