Hungarian Algorithm

The Hungarian algorithm, also called the Hungarian method, is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and anticipated later primal-dual methods. It was developed and published in 1955 by Harold Kuhn, who named it for the earlier work of the Hungarian mathematicians Denes Konig and Jeno Egervary on which it was based. In 2006 it was discovered that Carl Gustav Jacobi had solved the same assignment problem in the nineteenth century, in a solution published posthumously in 1890.