The Hungarian method for the assignment problem
From MaRDI portal
Publication:3565231
DOI10.1007/978-3-540-68279-0_2zbMATH Open1187.90015OpenAlexW2405686381MaRDI QIDQ3565231FDOQ3565231
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
Recommendations
Collected or selected works; reprintings or translations of classics (01A75) Discrete location and assignment (90B80) History of operations research and mathematical programming (90-03)
Cited In (27)
- Title not available (Why is that?)
- Fast convergence in the double oral auction
- A note on Hungarian algorithm for assignment problems
- Optimal detection of the feature matching map in presence of noise and outliers
- Title not available (Why is that?)
- Solving a combinatorial problem with network flows
- The recurrent method to solve the assignment problem
- Point spread function field learning based on optimal transport distances
- Title not available (Why is that?)
- Extension of Egervàry theorem on optimal solution of assignment problem: logical approach
- Assignment Problems
- A tale of three eras: the discovery and rediscovery of the Hungarian method
- Consolidation of structure of high noise data by a new noise index and reinforcement learning
- Title not available (Why is that?)
- Revisiting the 0,1 assignment problem
- On tropical Kleene star matrices and alcoved polytopes
- Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication
- On the problem of transversal selection
- On Kuhn's Hungarian Method?A tribute from Hungary
- Depth search: remarks on the history of algorithms
- A labeling algorithm to solve the assignment problem
- Human steering angle estimation in video based on key point detection and Kalman filter
- Contributions to the hungarian method
- Solving maximum weighted matching on large graphs with deep reinforcement learning
- Classes of matrices associated with the optimal assignment problem
- A new algorithm for the assignment problem: An alternative to the Hungarian method
- Title not available (Why is that?)
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)