Abstract
The FORTRAN implementation of an efficient algorithm which solves the Bottleneck Assignment Problem is given.
Computational results are presented, showing the proposed method to be generally superior to the best known algorithms.
Zusammenfassung
Für das “Bottleneck Assignment Problem” wird eine FORTRAN-Implementierung eines wirkungsvollen Lösungsverfahrens angegeben.
Die angeführten Rechenergebnisse zeigen, daß die vorgeschlagene Methode den derzeit besten bekannten Algorithmen überlegen ist.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley 1974.
Carpaneto, G., Toth, P.: Algorithm 548 (Solution of the assignment problem). ACM Transactions on Mathematical Software1980, 104–111.
Derigs, U., Zimmermann, U.: An augmenting path method for solving linear Bottleneck assignment problems. Computing19, 285–295 (1978).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Carpaneto, G., Toth, P. Algorithm for the solution of the Bottleneck Assignment Problem. Computing 27, 179–187 (1981). https://doi.org/10.1007/BF02243552
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02243552