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.

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 22 May 2006.
HTML page formatted Mon Sep 11 09:46:05 2006.

Cite this as:
Paul E. Black, "Munkres' assignment algorithm", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 22 May 2006. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/munkresAssignment.html

to NIST home page