(en) « Harold W. Kuhn, in his celebrated paper entitled The Hungarian Method for the assignment problem, [Naval Research Logistic Quarterly, 2 (1955), pp. 83-97] described an algorithm for constructing a maximum weight perfect matching in a bipartite graph » dans András Frank(en), On Kuhn’s Hungarian Method – A tribute from Hungary
(en) Silvano Martello, « Jenö Egerváry: from the origins of the Hungarian algorithm to satellite communication », Central European Journal of Operations Research, vol. 18, no 1, , p. 47-58 (lire en ligne).
wikipedia.org
en.wikipedia.org
(en) « Harold W. Kuhn, in his celebrated paper entitled The Hungarian Method for the assignment problem, [Naval Research Logistic Quarterly, 2 (1955), pp. 83-97] described an algorithm for constructing a maximum weight perfect matching in a bipartite graph » dans András Frank(en), On Kuhn’s Hungarian Method – A tribute from Hungary