Abstract
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
Assignment problemComputer scienceHungarian algorithmYield (engineering)Work (physics)Mathematical optimizationMathematicsEngineering
Affiliated Institutions
Related Publications
Ants can colour graphs
AbstractIn the last few years researchers have shown how insect colonies can be seen as a natural model of collective problem solving. The analogy between the behaviour of ants ...
Ants can solve constraint satisfaction problems
We describe a novel incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to use artifici...
An Algorithm for the Traveling Salesman Problem
A “branch and bound” algorithm is presented for solving the traveling salesman problem. The set of all tours (feasible solutions) is broken up into increasingly small subsets by...
Rank-density-based multiobjective genetic algorithm and benchmark test function study
Concerns the use of evolutionary algorithms (EA) in solving multiobjective optimization problems (MOP). We propose the use of a rank-density-based genetic algorithm (RDGA) that ...
An Efficient Heuristic Procedure for Partitioning Graphs
We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to minimize the sum of the costs on all edges cut. This pr...
Publication Info
- Year
- 1955
- Type
- article
- Volume
- 2
- Issue
- 1-2
- Pages
- 83-97
- Citations
- 11964
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
11964
OpenAlex
Cite This
Harold W. Kuhn
(1955).
The Hungarian method for the assignment problem.
Naval Research Logistics Quarterly
, 2
(1-2)
, 83-97.
https://doi.org/10.1002/nav.3800020109
Identifiers
- DOI
- 10.1002/nav.3800020109