Hungarian Algorithm

Harold Kuhn, 1955

Published by Harold Kuhn in 1955 and named after the earlier work of Hungarian mathematicians König and Egerváry, this algorithm solves the assignment problem in polynomial time. It works by reducing a cost matrix through row and column subtractions, covering zeros with minimum lines, and adjusting values until an optimal assignment is found. Gold highlights the current reduction, teal marks zeros, and coral shows the final optimal assignment.