Munkres' assignment algorithm

(algorithm)

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.

Author: PEB

Implementation

Bob Pilgrim's example of step-wise coding of the algorithm (Pascal) from a description.

James Munkres, 1957.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 5 May 2010.
HTML page formatted Mon Feb 2 13:10:40 2015.

Cite this as:
Paul E. Black, "Munkres' assignment algorithm", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 5 May 2010. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/munkresAssignment.html