Skip to main content
Log in

Algorithm for the solution of the Bottleneck Assignment Problem

Algorithmus 44. Algorithmus für die Lösung des “Bottleneck Assignment Problem”

  • Algorithm
  • Published:
Computing Aims and scope Submit manuscript

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.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley 1974.

    Google Scholar 

  2. Carpaneto, G., Toth, P.: Algorithm 548 (Solution of the assignment problem). ACM Transactions on Mathematical Software1980, 104–111.

  3. Derigs, U., Zimmermann, U.: An augmenting path method for solving linear Bottleneck assignment problems. Computing19, 285–295 (1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02243552

Keywords

Navigation