On Kuhn's Hungarian method - A tribute from Hungary

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

Harold W. Kuhn, in his celebrated paper entitled "The Hungarian Method for the assignment problem" [Naval Res Logist Quart 2 (1955), 83-97] described an algorithm for constructing a maximum weight perfect matching in a bipartite graph. In his delightful reminescences ["On the origin of the Hungarian method," History of mathematical programming - a collection of personal reminiscences, J.K. Lenstra, A.H.G. Rinnooy Kan, and A. Schrijver (Editors), CWI, Amsterdam and North-Holland, Amsterdam, 1991, pp. 77-81], Kuhn explained how the works (from 1931) of two Hungarian mathematicians, D. König and E. Egerváry, had contributed to the invention of his algorithm, the reason why he named it the Hungarian Method. (For citations from Kuhn's account as well as for other invaluable historical notes on the subject, see A. Schrijver's monumental book [Combinatorial optimization: Polyhedra and efficiency, Algorithms and Combinatories 24, Springer, New York, 2003].) In this note I wish to pay tribute to Professor H.W. Kuhn by exhibiting the exact relationship between his Hungarian Method and the achievements of König and Egerváry, and by outlining the fundamental influence of his algorithm on Combinatorial Optimization where it became the prototype of a great number of algorithms in areas such as network flows, matroids, and matching theory. And finally, as a Hungarian, I would also like to illustrate that not only did Kuhn make use of ideas of Hungarian mathematicians, but his extremely elegant method has had a great impact on the work of a next generation of Hungarian researchers.

Original languageEnglish
Pages (from-to)2-5
Number of pages4
JournalNaval Research Logistics
Volume52
Issue number1
DOIs
Publication statusPublished - Feb 2005

Fingerprint

Combinatorial optimization
Combinatorial Optimization
Network Flow
Mathematical programming
Citations
Perfect Matching
Patents and inventions
Assignment Problem
Matroid
Mathematical Programming
Polyhedron
Bipartite Graph
Hungary
Prototype
Influence
History
Relationships
Network flow
Assignment problem
Bipartite graph

Keywords

  • Efficient algorithms
  • Hungarian Method
  • Weighted bipartite matchings

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

On Kuhn's Hungarian method - A tribute from Hungary. / Frank, A.

In: Naval Research Logistics, Vol. 52, No. 1, 02.2005, p. 2-5.

Research output: Contribution to journalArticle

@article{58d0bc0cc3a7469caa374a7d0c52e544,
title = "On Kuhn's Hungarian method - A tribute from Hungary",
abstract = "Harold W. Kuhn, in his celebrated paper entitled {"}The Hungarian Method for the assignment problem{"} [Naval Res Logist Quart 2 (1955), 83-97] described an algorithm for constructing a maximum weight perfect matching in a bipartite graph. In his delightful reminescences [{"}On the origin of the Hungarian method,{"} History of mathematical programming - a collection of personal reminiscences, J.K. Lenstra, A.H.G. Rinnooy Kan, and A. Schrijver (Editors), CWI, Amsterdam and North-Holland, Amsterdam, 1991, pp. 77-81], Kuhn explained how the works (from 1931) of two Hungarian mathematicians, D. K{\"o}nig and E. Egerv{\'a}ry, had contributed to the invention of his algorithm, the reason why he named it the Hungarian Method. (For citations from Kuhn's account as well as for other invaluable historical notes on the subject, see A. Schrijver's monumental book [Combinatorial optimization: Polyhedra and efficiency, Algorithms and Combinatories 24, Springer, New York, 2003].) In this note I wish to pay tribute to Professor H.W. Kuhn by exhibiting the exact relationship between his Hungarian Method and the achievements of K{\"o}nig and Egerv{\'a}ry, and by outlining the fundamental influence of his algorithm on Combinatorial Optimization where it became the prototype of a great number of algorithms in areas such as network flows, matroids, and matching theory. And finally, as a Hungarian, I would also like to illustrate that not only did Kuhn make use of ideas of Hungarian mathematicians, but his extremely elegant method has had a great impact on the work of a next generation of Hungarian researchers.",
keywords = "Efficient algorithms, Hungarian Method, Weighted bipartite matchings",
author = "A. Frank",
year = "2005",
month = "2",
doi = "10.1002/nav.20056",
language = "English",
volume = "52",
pages = "2--5",
journal = "Naval Research Logistics Quarterly",
issn = "0028-1441",
publisher = "John Wiley and Sons Inc.",
number = "1",

}

TY - JOUR

T1 - On Kuhn's Hungarian method - A tribute from Hungary

AU - Frank, A.

PY - 2005/2

Y1 - 2005/2

N2 - Harold W. Kuhn, in his celebrated paper entitled "The Hungarian Method for the assignment problem" [Naval Res Logist Quart 2 (1955), 83-97] described an algorithm for constructing a maximum weight perfect matching in a bipartite graph. In his delightful reminescences ["On the origin of the Hungarian method," History of mathematical programming - a collection of personal reminiscences, J.K. Lenstra, A.H.G. Rinnooy Kan, and A. Schrijver (Editors), CWI, Amsterdam and North-Holland, Amsterdam, 1991, pp. 77-81], Kuhn explained how the works (from 1931) of two Hungarian mathematicians, D. König and E. Egerváry, had contributed to the invention of his algorithm, the reason why he named it the Hungarian Method. (For citations from Kuhn's account as well as for other invaluable historical notes on the subject, see A. Schrijver's monumental book [Combinatorial optimization: Polyhedra and efficiency, Algorithms and Combinatories 24, Springer, New York, 2003].) In this note I wish to pay tribute to Professor H.W. Kuhn by exhibiting the exact relationship between his Hungarian Method and the achievements of König and Egerváry, and by outlining the fundamental influence of his algorithm on Combinatorial Optimization where it became the prototype of a great number of algorithms in areas such as network flows, matroids, and matching theory. And finally, as a Hungarian, I would also like to illustrate that not only did Kuhn make use of ideas of Hungarian mathematicians, but his extremely elegant method has had a great impact on the work of a next generation of Hungarian researchers.

AB - Harold W. Kuhn, in his celebrated paper entitled "The Hungarian Method for the assignment problem" [Naval Res Logist Quart 2 (1955), 83-97] described an algorithm for constructing a maximum weight perfect matching in a bipartite graph. In his delightful reminescences ["On the origin of the Hungarian method," History of mathematical programming - a collection of personal reminiscences, J.K. Lenstra, A.H.G. Rinnooy Kan, and A. Schrijver (Editors), CWI, Amsterdam and North-Holland, Amsterdam, 1991, pp. 77-81], Kuhn explained how the works (from 1931) of two Hungarian mathematicians, D. König and E. Egerváry, had contributed to the invention of his algorithm, the reason why he named it the Hungarian Method. (For citations from Kuhn's account as well as for other invaluable historical notes on the subject, see A. Schrijver's monumental book [Combinatorial optimization: Polyhedra and efficiency, Algorithms and Combinatories 24, Springer, New York, 2003].) In this note I wish to pay tribute to Professor H.W. Kuhn by exhibiting the exact relationship between his Hungarian Method and the achievements of König and Egerváry, and by outlining the fundamental influence of his algorithm on Combinatorial Optimization where it became the prototype of a great number of algorithms in areas such as network flows, matroids, and matching theory. And finally, as a Hungarian, I would also like to illustrate that not only did Kuhn make use of ideas of Hungarian mathematicians, but his extremely elegant method has had a great impact on the work of a next generation of Hungarian researchers.

KW - Efficient algorithms

KW - Hungarian Method

KW - Weighted bipartite matchings

UR - http://www.scopus.com/inward/record.url?scp=13144249228&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=13144249228&partnerID=8YFLogxK

U2 - 10.1002/nav.20056

DO - 10.1002/nav.20056

M3 - Article

VL - 52

SP - 2

EP - 5

JO - Naval Research Logistics Quarterly

JF - Naval Research Logistics Quarterly

SN - 0028-1441

IS - 1

ER -