The Hungarian method for the assignment problem

H. W. Kuhn

Naval Research Logistics Quarterly, 1955, vol. 2, issue 1‐2, 83-97

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.

Date: 1955
References: Add references at CitEc
Citations: View citations in EconPapers (155)

Downloads: (external link)
https://doi.org/10.1002/nav.3800020109

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:2:y:1955:i:1-2:p:83-97

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().