IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v18y2010i1p47-58.html
   My bibliography  Save this article

Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication

Author

Listed:
  • Silvano Martello

Abstract

We discuss some relevant results obtained by Egerváry in the early Thirties, whose importance has been recognized several years later. We start with a quite well-known historical fact: the first modern polynomial-time algorithm for the assignment problem, invented by Harold W. Kuhn half a century ago, was christened the “Hungarian method” to highlight that it derives from two older results, by Kőnig (Math Ann 77:453–465, 1916) and Egerváry (Mat Fiz Lapok 38:16–28, 1931) (A recently discovered posthumous paper by Jacobi (1804–1851) contains however a solution method that appears to be equivalent to the Hungarian algorithm). Our second topic concerns a combinatorial optimization problem, independently defined in satellite communication and in scheduling theory, for which the same polynomial-time algorithm was independently published 30 years ago by various authors. It can be shown that such algorithm directly implements another result contained in the same 1931 paper by Egerváry. We finally observe that the latter result also implies the famous Birkhoff-von Neumann theorem on doubly stochastic matrices. Copyright Springer-Verlag 2010

Suggested Citation

  • Silvano Martello, 2010. "Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 18(1), pages 47-58, March.
    • Handle: RePEc:spr:cejnor:v:18:y:2010:i:1:p:47-58
    DOI: 10.1007/s10100-009-0125-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-009-0125-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10100-009-0125-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Robert Thorndike, 1950. "The problem of classification of personnel," Psychometrika, Springer;The Psychometric Society, vol. 15(3), pages 215-235, September.
    2. Harold W. Kuhn, 2002. "Being in the Right Place at the Right Time," Operations Research, INFORMS, vol. 50(1), pages 132-134, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Helena Gaspars-Wieloch, 2021. "The Assignment Problem in Human Resource Project Management under Uncertainty," Risks, MDPI, vol. 9(1), pages 1-17, January.
    2. T. Csendes & A. Galántai & L. Szeidl, 2010. "Special issue in honour of Jenő Egerváry," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 18(1), pages 1-3, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Paul Dwyer, 1954. "Solution of the personnel classification problem with the method of optimal regions," Psychometrika, Springer;The Psychometric Society, vol. 19(1), pages 11-26, March.
    2. Ivan Belik & Kurt Jornsten, 2018. "Critical objective function values in linear sum assignment problems," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 842-852, April.
    3. Günter Knieps, 2019. "Internet der Dinge und die Zukunft der Netzökonomie [Internet of Things and the Future of Network Economics]," Wirtschaftsdienst, Springer;ZBW - Leibniz Information Centre for Economics, vol. 99(5), pages 348-354, May.
    4. Frederic Lord, 1952. "Notes on a problem of multiple classification," Psychometrika, Springer;The Psychometric Society, vol. 17(3), pages 297-304, September.
    5. D. Votaw, 1952. "Methods of solving some personnel-classification problems," Psychometrika, Springer;The Psychometric Society, vol. 17(3), pages 255-266, September.
    6. David Boyce, 2007. "Forecasting Travel on Congested Urban Transportation Networks: Review and Prospects for Network Equilibrium Models," Networks and Spatial Economics, Springer, vol. 7(2), pages 99-128, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:18:y:2010:i:1:p:47-58. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.