50 Years of Integer Programming 1958-2008 pp 29-47 | Cite as
The Hungarian Method for the Assignment Problem
Chapter
First Online:
- 111 Citations
- 6.3k Downloads
Abstract
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.
Keywords
Graph Theory Combinatorial Optimization Integer Program Assignment Problem National Bureau
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 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.zbMATHGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2010