Hungarian algorithm
Algoritmo húngaro
- Date
- 1955 · confidence high
- Place
- Princeton, New Jersey, United States
- Credited to
- Harold W. Kuhn
- Field
- Knowledge & symbols
What it is
Mathematician Harold W. Kuhn published the Hungarian method for solving the assignment problem in polynomial time in 1955 at Princeton University, building on earlier work by Hungarians Dénes Kőnig and Jenő Egerváry.
What it led to
- Bipartite graph matching algorithms
- Resource and task assignment optimization
- Primal-dual methods in linear programming