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.
Similar content being viewed by others
References
Birkhoff G (1946) Tres observaciones sobre el algebra lineal. Revista Facultad de Ciencias Exactas, Puras y Aplicadas Universidad Nacional de Tucuman, Serie A (Matematicas y Fisica Teorica), vol 5, pp 147–151
Burkard R, Dell’Amico M, Martello S (2009) Assignment Problems. SIAM, Philadelphia. Home page http://www.assignmentproblems.com
Dell’Amico M, Martello S (1996) Open shop, satellite communication and a theorem by Egerváry (1931). Oper Res Lett 18: 207–211
Easterfield TE (1946) A combinatorial algorithm. J Lond Math Soc 21: 219–226
Edmonds J (1965) Paths, trees and flowers. Can J Math 17: 449–467
Egerváry E (1931) Matrixok kombinatorius tulajdonságairol. Mat Fiz Lapok 38:16–28 (English translation by Kuhn 1955b)
Farkas J (1902) Über die Theorie der einfachen Ungleichungen. J reine angew Math 124: 2–27
Frank A (2004) On Kuhn’s Hungarian method—a tribute from Hungary. Nav Res Log Quart 52: 2–5
Frobenius FG (1912) Über Matrizen aus nicht negativen Elementen. Sitzungsberichte der Königlich Preußischen Akademie der Wissenschaften zu Berlin, Phys Math Kl, pp 456–477. Reprinted in Ferdinand Georg Frobenius, Gesammelte Abhandlungen, Band III (Serre J-P, ed), Springer, Berlin, 1968, pp 546–567
Frobenius FG (1917) Über zerlegbare Determinanten. Sitzungsberichte der Königlich Preußischen Akademie der Wissenschaften zu Berlin XVIII: 274–277
Galántai A (2008) The life and work of the Hungarian mathematician E. Egerváry. In: AIRO8–XXXIX annual conference of Italian operational research society, Ischia, Italy
Gallai T (1986) Dénes Kőnig: A biographical sketch. In: Theory of finite and infinite graphs, pp 423–426. Birkhäuser, Boston. English translation by R. McCoart of Kőnig (1936)
Gonzalez T, Sahni S (1976) Open shop scheduling to minimize finish time. J ACM 23: 665–679
Hall P (1935) On representatives of subsets. J Lond Math Soc 10: 26–30
Inukai T (1979) An efficient SS/TDMA time slot assignment algorithm. IEEE Trans Commun 27: 1449–1455
Jacobi CGJ (1890) De investigando ordine systematis aequationum differentialium vulgarium cujuscunque. In: Weierstrass K (ed) C.G.J. Jacobi’s gesammelte Werke, fünfter Band. Druck und Verlag von Georg Reimer, Berlin, pp 193–216. Originally published by C.W. Borchardt in Borchardt Journal für die reine und angewandte Mathematik, Bd 64, pp 297–320
Jacobi CGJ (2007) About the research of the order of a system of arbitrary ordinary differential equations. http://www.lix.polytechnique.fr/~ollivier/JACOBI/jacobiEngl.htm. English translation by F. Ollivier of Jacobi (1890)
Jüttner A (2004) On the efficiency of Egerváry’s perfect matching algorithm. Technical Report TR-2004-13, Egerváry Research Group, Budapest. http://www.cs.elte.hu/egres
Kőnig D (1916) Uber Graphen und ihre Anwendungen. Math Ann 77: 453–465
Kőnig D (1936) Theorie der Endlichen und Unendlichen Graphen. Akademische Verlagsgesellschaft M.B.H., Leipzig
Kuhn HW (1955a) The Hungarian method for the assignment problem. Nav Res Log Quart 2: 83–97
Kuhn HW (1955b) On combinatorial properties of matrices. Logistic Papers 11, 4, George Washington University
Kuhn HW (1956) Variants of the Hungarian method for the assignment problem. Nav Res Log Quart 3: 253–258
Kuhn HW (1991) On the origin of the Hungarian method. In: Lenstra JK, Rinnooy Kan AHG, Schrijver A (eds) History of mathematical programming. North-Holland, Amsterdam, pp 77–81
Kuhn HW (2002) Being in the right place at the right time. Oper Res 50: 132–134
Miller GA (1910) On a method due to Galois. Q J Math 41: 382–384
Monge G (1781) Mémoire sur la théorie des déblais et des remblais. In: Histoire de l’Académie Royale des Sciences de Paris, avec les Mémoires de Mathématique et de Physique pour la même année (pp 666–704), Paris
Ollivier F, Sadik B (2007) La borne de Jacobi pour une diffiété définie par un système quasi régulier. C R Acad Sci Paris 345:139–144. Abriged English version: Jacobi’s bound for a diffiety defined by a quasi-regular system
Rapcsák T (2009) The life and works of Jenő Egerváry. Cent Eur J Oper Res (this issue)
Rózsa P (1984) Jenő Egerváry: a great personality of the Hungarian mathematical school. Period Polytech Electr Eng 28: 287–298
Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Heidelberg
Schrijver A (2005) On the history of combinatorial optimization (till 1960). In: Aardal K, Nemhauser GL, Weismantel R (eds) Discrete optimization, vol 12 of Handbooks in operations research and management science. Elsevier, Amsterdam, pp 1–68
Stigler SM (1980) Stigler’s law of eponymy. Trans NY Acad Sci 39: 147–157
Sylvester JJ (1850) Additions to the articles, “On a new class of theorems,” and “On Pascals theorem.” Philos Mag XXXVII:363–370. Reprinted in the collected mathematical papers of James Joseph Sylvester, vol 1 (1837–1853), Cambridge University Press, 1904, p 150
Thorndike RL (1950) The problem of classification of personnel. Psychometrica 15: 215–235
von Neumann HJ (1953) A certain zero-sum two-person game equivalent to the optimal assignment problem. In: Kuhn HW, Tucker AW (eds) Contributions to the theory of games, vol II, vol 28 of Ann Math Stud. Princeton University Press, Princeton, pp 5–12
Votaw DF, Orden A (1952) The personnel assignment problem. In: Symposium on linear inequalities and programming, SCOOP 10. U.S. Air Force, pp 155–163
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Martello, S. Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication. Cent Eur J Oper Res 18, 47–58 (2010). https://doi.org/10.1007/s10100-009-0125-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-009-0125-z