Hungarian Assignment Algorithm

From GM-RKB
(Redirected from Hungarian Algorithm)
Jump to navigation Jump to search

A Hungarian Assignment Algorithm is an assignment algorithm that is a combinatorial optimization algorithm.



References

2014

  1. Harold W. Kuhn, "The Hungarian Method for the assignment problem", Naval Research Logistics Quarterly, 2:83–97, 1955. Kuhn's original publication.
  2. Harold W. Kuhn, "Variants of the Hungarian method for assignment problems", Naval Research Logistics Quarterly, 3: 253–258, 1956.
  3. J. Munkres, "Algorithms for the Assignment and Transportation Problems", Journal of the Society for Industrial and Applied Mathematics, 5(1):32–38, 1957 March.
  4. http://www.lix.polytechnique.fr/~ollivier/JACOBI/jacobiEngl.htm


1955

  • (Kuhn, 1955) ⇒ Harold W. Kuhn. (1955). “The Hungarian method for the assignment problem." Naval research logistics quarterly, 2(1-2).