The Hungarian Method for the Assignment Problem
This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and combinatorial tools from graph theory. It may be of some interest to tell the story of its origin.
Unable to display preview. Download preview PDF.
- 1.H.W. Kuhn, 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, eds.), North Holland, Amsterdam, 1991, pp. 77–81.Google Scholar
- 2.A. Schrijver, Combinatorial optimization: polyhedra and efficiency, Vol. A. Paths, Flows, Matchings, Springer, Berlin, 2003.Google Scholar