The Hungarian method for the assignment problem (1955)
by
H. W. Kuhn
,
Bryn Yaw
| Venue: | Naval Res. Logist. Quart |
| Citations: | 510 - 0 self |
BibTeX
@ARTICLE{Kuhn55thehungarian,
author = {H. W. Kuhn and Bryn Yaw},
title = {The Hungarian method for the assignment problem},
journal = {Naval Res. Logist. Quart},
year = {1955},
pages = {83--97}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1.
Citations
| 146 | Algorithms for the Assignment and Transportation Problems - Munkres |
| 24 | A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem - Ford, Fulkerson - 1957 |
| 13 | The traveling-salesman problem - FLOOD - 1956 |
| 1 | The Assignment Problem,"Proc. of Symposia in - Motzkin - 1956 |
| 1 | An Algorithm for Distinct Representatives,"Amer - Hall - 1956 |
