Assignment by means of the «Branch and Bound» Algorithm
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.
KeywordsHuman Resource Fuzzy Relation Interactive Management Hungarian Algorithm Classic Perspective
Unable to display preview. Download preview PDF.