.png){kind=icon}
Return
The Hungarian method for the assignment problem
.png){kind=icon}
OA
AI
DOI：10.1002/nav.3800020109.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
AbstractAssuming 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.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available