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

Robert Pilgrim's example of step-wise coding of the algorithm (C#) from a description. Also available here.

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 Black.

Entry modified 28 August 2024.
HTML page formatted Wed Oct 30 12:15:30 2024.

Cite this as:
Paul E. Black, "Munkres' assignment algorithm", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 28 August 2024. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/munkresAssignment.html