Jenő Egerváry
Born(1891-04-16)April 16, 1891
Debrecen, Hungary
Died(1958-11-30)November 30, 1958
Budapest, Hungary
NationalityHungarian
Alma materUniversity of Pázmány Péter
Known forKőnig–Egerváry theorem
AwardsGyula Kőnig Prize (1932), Kossuth Prize (1949)
Scientific career
FieldsMathematician
Doctoral advisorLeopold Fejér

Jenő Elek Egerváry (April 16, 1891 – November 30, 1958) was a Hungarian mathematician.

Biography

Egerváry was born in Debrecen in 1891. In 1914, he received his doctorate at the Pázmány Péter University in Budapest, where he studied under the supervision of Lipót Fejér. He then worked as an assistant at the Seismological Observatory in Budapest, and since 1918 as a professor at the Superior Industrial School in Budapest. In 1938 he was appointed Privatdozent at the Pázmány Péter University in Budapest.[1]

In 1941 he became a full professor at the Technical University of Budapest, and in 1950 he was appointed Chairman of the Scientific Council of the Research Institute for Applied Mathematics of the Hungarian Academy of Sciences.[2]

Egerváry received the Gyula Kőnig Prize in 1932 and the Kossuth Prize in 1949 and 1953.[2]

He committed suicide in 1958 because of the troubles caused to him by the communist bureaucracy.[3]

Works

Egerváry's interests spanned the theory of algebraic equations, geometry, differential equations, and matrix theory.[1]

In what later became a classic result in the field of combinatorial optimization,[4] Egerváry generalized Kőnig's theorem to the case of weighted graphs.[5] This contribution was translated and published in 1955 by Harold W. Kuhn,[6] who also showed how to apply Kőnig's and Egerváry's method to solve the assignment problem; the resulting algorithm has since been known as the "Hungarian method".[7]

See also

Notes

  1. 1 2 Rózsa 1984.
  2. 1 2 Horváth 2005.
  3. ↑ Spedicato, Emilio (November 2008). "Ricordo di Egerváry" (PDF). Notiziario dell'Unione Matematica Italiana (in Italian). Archived from the original (PDF) on 2012-03-30. Archived 2012-03-30 at the Wayback Machine
  4. ↑ Schrijver, Alexander (2003). Combinatorial Optimization – Polyhedra and Efficiency. Springer. ISBN 978-3-540-44389-6.
  5. ↑ Egerváry, Jenő (1931), "Matrixok kombinatorius tulajdonságairól" [On combinatorial properties of matrices], Matematikai és Fizikai Lapok (in Hungarian), 38: 16–28
  6. ↑ Kuhn, Harold W. (1955), "On combinatorial properties of matrices", Logistics Papers, George Washington University, 11: 1–11
  7. ↑ Kuhn, Harold W. (1955), "The Hungarian Method for the assignment problem", Naval Research Logistics Quarterly, 2 (1–2): 83–97, CiteSeerX 10.1.1.228.3906, doi:10.1002/nav.3800020109

References

  • Rózsa, Pál (1984), "Jenő Egerváry – A great personality of the Hungarian mathematical school", Periodica Polytechnica Electrical Engineering, Budapest University of Technology and Economics, 28: 287–298
  • Horváth, János (2005), A panorama of Hungarian mathematics in the twentieth century, vol. 1, Springer
  • Martello, Silvano (2010), "Jenő Egerváry: From the origins of the Hungarian algorithm to satellite communication", Central European Journal of Operations Research, 18: 47–58, doi:10.1007/s10100-009-0125-z, S2CID 7548763
  • Rapcsák, Tamás (2010), "The life and works of Jenő Egerváry (1891–1958)", Central European Journal of Operations Research, 18: 59–71, doi:10.1007/s10100-009-0127-x, S2CID 32528968
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.