The Hungarian method for the assignment problem

作者：Harold William Kuhn · 发表于：Naval Research Logistics Quarterly · 年份：1955 · DOI：10.1002/nav.3800020109 · 被引用次数：13027 · 研究领域：Optimization and Mathematical Programming、Scheduling and Timetabling Solutions、Multi-Criteria Decision Making

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.