Definition: Solve the assignment problem in polynomial time by marking and unmarking entries and covering and uncovering rows and columns.
Also known as Hungarian algorithm.
James Munkres, 1957.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 25 February 2019.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "Munkres' assignment algorithm", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 25 February 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/munkresAssignment.html