The Hungarian method for the assignment problem
Harold William Kuhn · Naval Research Logistics Quarterly · 1955
Abstract Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the “assignment problem” is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent in the work of two Hungarian mathematicians may be exploited to yield a new method of solving this problem.
Cited by 12,818 works. doi:10.1002/nav.3800020109
Authors
References
- On Representatives of Subsets
- Application of the simplex method to a transportation problem
- Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre
- On the Hitchcock distribution problem
- The Problem of Classification of Personnel
- A Combinatorial Algorithm
- A personnel assignment problem
- Solution of the Personnel Classification Problem with the Method of Optimal Regions