The Hungarian method for the assignment problem
Author:
- 1 March 1955
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 2 (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.Keywords
This publication has 7 references indexed in Scilit:
- Solution of the Personnel Classification Problem with the Method of Optimal RegionsPsychometrika, 1954
- 1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem1953
- On the Hitchcock distribution problemPacific Journal of Mathematics, 1953
- The Problem of Classification of PersonnelPsychometrika, 1950
- A Combinatorial AlgorithmJournal of the London Mathematical Society, 1946
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935
- Über Graphen und ihre Anwendung auf Determinantentheorie und MengenlehreMathematische Annalen, 1916