Skip to main content
SpringerLink
Log in

A shortest augmenting path algorithm for dense and sparse linear assignment problems

  • Conference paper
DGOR/NSOR

Part of the book series: Operations Research Proceedings ((ORP,volume 1987))

Abstract

The linear assignment problem (LAP) is useful as a relaxation for difficult combinatorial optimization problems (quadratic assignment, travelling salesman). Theoretical developments for the LAP can often be extended to problems as minimum cost flow and transportation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. D.P. Bertsekas (1981). A New Algorithm for the Linear Assignment Problem. Mathematical Programming 21, 152–171.

    Article  Google Scholar 

  2. G. Carpaneto, P. Toth (1980). Algorithm 5458 (Solution of the Assignment Problem). ACM Transactions on Mathematical Software 6, 104–111.

    Article  Google Scholar 

  3. B. Dorhout (1975). Experiments with Some Algorithms for the Linear Assignment Problem. Report BW 39, Mathematisch Centrum, Amsterdam.

    Google Scholar 

  4. M.S. Hung, W.O Rom (1980). Solving the Assignment Problem by Relaxation. Operations Research 28, 969–982.

    Article  Google Scholar 

  5. R. Jonker, A. Volgenant (1987) A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38, 325–340.

    Article  Google Scholar 

Download references

Authors
  1. Roy Jonker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ton Volgenant
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Mathematik, Technische Hochschule Darmstadt, Schloßgartenstraße 7, D-6100, Darmstadt, Deutschland

    Helmut Schellhaas

  2. Department of Mathematics, Agricultural University Wageningen, De Dreijen 8, NL-6703 BC, Wageningen, The Netherlands

    Paul van Beek

  3. Fachbereich Wirtschaftswissenschaft, Johann Wolfgang Goethe-Universität Frankfurt, Mertonstraße 17, D-6000, Frankfurt, Deutschland

    Heinz Isermann

  4. Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität Kiel, Olshausenstraße 40, D-2300, Kiel, Deutschland

    Reinhart Schmidt

  5. Centre for Quantitative Methods, Nederlandse Philips Bedrijven B.V., P.O. Box 218, NL-5600 MD, Eindhoven, The Netherlands

    Mynt Zijlstra

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jonker, R., Volgenant, T. (1988). A shortest augmenting path algorithm for dense and sparse linear assignment problems. In: Schellhaas, H., van Beek, P., Isermann, H., Schmidt, R., Zijlstra, M. (eds) DGOR/NSOR. Operations Research Proceedings, vol 1987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73778-7_164

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-73778-7_164

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19365-4

  • Online ISBN: 978-3-642-73778-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation