NIST

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

Example of step-wise coding of the algorithm (Pascal) from a description. The Common Lisp library (CLLIB) implementation (Common Lisp).

More information

James Munkres, 1957.

Go to the Dictionary of Algorithms and Data Structures home page.

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

Entry modified Fri Dec 17 12:28:27 2004.
HTML page formatted Wed Oct 26 09:47:50 2005.

Cite this as:
Paul E. Black, "Munkres' assignment algorithm", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST.
http://www.nist.gov/dads/HTML/munkresAssignment.html

to NIST home page