Article
The Hungarian method for the assignment problem†
"Library LinksӠ
The preparation of this report was supported, in part, by the ONR Logistics Project, Department of Mathematics, Princeton University.
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.
