The Hungarian method for the assignment problem

DOI10.1007/978-3-540-68279-0_2MaRDI QIDQ3565231zbMATH OpenOpenAlexFDO

Authors Harold W. Kuhn

Publication date 3 June 2010

Published in 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68279-0_2

Mathematics Subject Classification ID

Collected or selected works; reprintings or translations of classics (01A75) Discrete location and assignment (90B80) History of operations research and mathematical programming (90-03)

Recommendations

• On Kuhn's Hungarian Method?A tribute from Hungary
• Contributions to the hungarian method
• scientific article; zbMATH DE number 1179832
• Assignment Problems
• Assignment problems: a golden anniversary survey

Cited in

(27)

• scientific article; zbMATH DE number 5556493 (Why is no real title available?)
• The recurrent method to solve the assignment problem
• A tale of three eras: the discovery and rediscovery of the Hungarian method
• Assignment Problems
• Point spread function field learning based on optimal transport distances
• Fast convergence in the double oral auction
• A note on Hungarian algorithm for assignment problems
• Depth search: remarks on the history of algorithms
• Human steering angle estimation in video based on key point detection and Kalman filter
• Consolidation of structure of high noise data by a new noise index and reinforcement learning
• Solving a combinatorial problem with network flows
• Revisiting the 0,1 assignment problem
• scientific article; zbMATH DE number 4127004 (Why is no real title available?)
• A labeling algorithm to solve the assignment problem
• Classes of matrices associated with the optimal assignment problem
• On Kuhn's Hungarian Method?A tribute from Hungary
• Extension of Egervàry theorem on optimal solution of assignment problem: logical approach
• On tropical Kleene star matrices and alcoved polytopes
• Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication
• scientific article; zbMATH DE number 4091179 (Why is no real title available?)
• On the problem of transversal selection
• scientific article; zbMATH DE number 3991510 (Why is no real title available?)
• A new algorithm for the assignment problem: An alternative to the Hungarian method
• Optimal detection of the feature matching map in presence of noise and outliers
• Contributions to the hungarian method
• scientific article; zbMATH DE number 1179832 (Why is no real title available?)
• Solving maximum weighted matching on large graphs with deep reinforcement learning

This page was built for publication: The Hungarian method for the assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565231)