The Hungarian method for the assignment problem

@article{Kuhn2010TheHM,
  title={The Hungarian method for the assignment problem},
  author={Harold W. Kuhn},
  journal={Naval Research Logistics (NRL)},
  year={2010},
  volume={52}
}
  • H. Kuhn
  • Published 1 March 1955
  • Economics
  • Naval Research Logistics (NRL)
This paper has been presented with the Best Paper Award. It will appear in print in Volume 52, No. 1, February 2005. 
A note on Hungarian method for solving assignment problem
TLDR
Hungarian method is modified to find out the optimal solution of an assignment problem which reduces the computational cost of the method.
The optimal assignment problem: an investigation into current solutions, new approaches and the doubly stochastic polytope
MSc(Eng),Faculty of Engineering and the Built Environment, University of the Witwatersrand, 2010
An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem
TLDR
The Hungarian algorithm for assignment problem to solve traveling salesman problem is applied and tree examples of application are included.
Computational Studies of Randomized Multidimensional Assignment Problems
In this chapter, we consider a class of combinatorial optimization problems on hypergraph matchings that represent multidimensional generalizations of the well-known linear assignment problem (LAP).
Optimal Solution of an Assignment problem as a special case of Transportation Problem
TLDR
This paper examines another method for solving an assignment problem and the numerical illustrations has been given to comprehend the procedure of proposed algorithm.
HYPERGRAPH MATCHINGS AND DESIGNS
  • Peter Keevash
  • Mathematics
    Proceedings of the International Congress of Mathematicians (ICM 2018)
  • 2019
We survey some aspects of the perfect matching problem in hypergraphs, with particular emphasis on structural characterisation of the existence problem in dense hypergraphs and the existence of
Fifty-Plus Years of Combinatorial Integer Programming
  • W. Cook
  • Mathematics
    50 Years of Integer Programming
  • 2010
Throughout the history of integer programming, the field has been guided by research into solution approaches to combinatorial problems. We discuss some of the highlights and defining moments of this
On the maximum of a special random assignment process
We consider the asymptotic behavior of the expectation of the maximum for a special assignment process with constant or i.i.d. coefficients. We show how it depends on the coefficients’ distribution.
Introduction: Best Matching and Best Match
TLDR
The purpose is to present the basic definitions of best matching in the context of distributed manufacturing, supply, and service systems, highlight its impact on the competitive performance of such systems, and outline the structure and objectives of this book.
...
...

References

SHOWING 1-10 OF 20 REFERENCES
Solution of the personnel classification problem with the method of optimal regions
The personnel classification problem is identified mathematically with other problems in the social and biological sciences. This mathematical problem is shown to be a special case of the general
Mathematics
AbstractTHE calculus of matrices has had a curious history. It was first used by Hamilton in 1853 under the name of “Linear and Vector Functions”. Cay ley used the term matrix in 1854, and developed
The problem of classification of personnel
TLDR
The personnel classification problem arises in its pure form when all job applicants must be used, being divided among a number of job categories, and problems of establishing the optimum administrative procedure of using test results for assignment are described.
On Representatives of Subsets
Let a set S of mn things be divided into m classes of n things each in two distinct ways, (a) and (b); so that there are m (a)-classes and m (b)-classes. Then it is always possible to find a set R of
On A Personnel Assignment Problem
  • W. Wei
  • Mathematics
    Int. J. Found. Comput. Sci.
  • 1990
A Combinatorial Algorithm
2. It is obvious that if the pattern formed by those elements which are the least in their respective rows is such that it is possible to choose from among these elements (hereinafter to be called
...
...