Skip to main content

Advertisement

Springer Nature Link
Log in

Algorithm for the solution of the assignment problem for sparse matrices

  • Algorithm
  • Published:
Computing Aims and scope Submit manuscript

Abstract

The FORTRAN implementation of an efficient algorithm which solves the Assignment Problem for sparse matrices is given. Computional results are presented, showing the proposed method to be generally superior to the best known algorithms.

Zusammenfassung

Für Zuordnungsprobleme mit dünn besetzter Kostenmatrix wird eine FORTRAN-Implementierung eines wirkungsvollen Lösungsverfahren angegeben. Die angeführten Rechenergebnisse zeigen, daß die vorgeschlagene Methode den derzeit besten bekannten Algorithmen ühberlegen ist.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

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. Barr, R. S., Glover, F., Klingman, D.: The alternating basis algorithm for assignment problems. Mathematical Programming13, 1–13 (1977).

    Google Scholar 

  3. Burkard, R. E., Derigs, U.: Assignment and matching problems: solution methods with FORTRAN-programs, pp. 1–11. Berlin-Heidelberg-New York: Springer 1980.

    Google Scholar 

  4. Carpaneto, G., Toth, P.: Algorithm 548 (solution of the assignment problem). ACM Trans. on Mathematical Software6, 104–111 (1980).

    Google Scholar 

  5. Carpaneto, G., Martello, S., Toth, P.: Il problema dell'assegnamento. Tech. Rep. 13. 81, SOFMAT, Progetto Finalizzato Informatica del CNR, Roma (1981).

  6. Kuhn, N. W.: The hungarian method for the assignment problem. Naval Res. Logist. Quart.2, 83–97 (1955).

    Google Scholar 

  7. Lawler, E.: Combinatorial optimization: networks and matroids, pp. 201–207. New York: Holt, Rinehart and Wilson 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Automatica, Università Degli Studi di Bologna, Viale Risorgimento 2, I-40136, Bologna, Italy

    G. Carpaneto

  2. Istituto di Informatica e Sistemistica, Unviersitá Degli Studi di Firenze, Via S. Marta 3, I-50139, Firenze, Italy

    P. Toth

Authors
  1. G. Carpaneto
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. P. Toth
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Research supported by CNR Italy.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Carpaneto, G., Toth, P. Algorithm for the solution of the assignment problem for sparse matrices. Computing 31, 83–94 (1983). https://doi.org/10.1007/BF02247938

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS Subject Classifications

Key words