Content deleted Content added
→Example: Add exhaustive proof |
Undid revision 1144784037 by Cmglee (talk) The procedure does not use the same naming conventions as the rest of the article. The presented algorithm seems to not work every time, or the description is at least not complete (what if no row or column has a single 0 ?), this is not the one detailed in the article. It is very confusing without a detailed explanation of the steps. |
||
Line 1:
{{Short description|Polynomial-time algorithm for the assignment problem}}
The '''Hungarian method''' is a [[combinatorial optimization]] [[algorithm]] that solves the [[assignment problem]] in [[polynomial time]] and which anticipated later [[Duality (optimization)|primal–dual methods]]. It was developed and published in 1955 by [[Harold Kuhn]], who gave the name "Hungarian method" because the algorithm was largely based on the earlier works of two [[Hungary|Hungarian]] mathematicians: [[Dénes Kőnig]] and [[Jenő Egerváry]].<ref name="kuhn1955">Harold W. Kuhn, "The Hungarian Method for the assignment problem", ''[[Naval Research Logistics Quarterly]]'', '''2''': 83–97, 1955. Kuhn's original publication.</ref><ref name="kuhn1956">Harold W. Kuhn, "Variants of the Hungarian method for assignment problems", ''Naval Research Logistics Quarterly'', '''3''': 253–258, 1956.</ref>
| |||