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

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.

[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.

[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".