The Hungarian Method for the Assignment Problem
From MaRDI portal
Publication:3565231
DOI10.1007/978-3-540-68279-0_2zbMath1187.90015OpenAlexW2405686381MaRDI QIDQ3565231
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
Discrete location and assignment (90B80) Collected or selected works; reprintings or translations of classics (01A75) History of operations research and mathematical programming (90-03)
Related Items (7)
Fast Convergence in the Double Oral Auction ⋮ Solving maximum weighted matching on large graphs with deep reinforcement learning ⋮ Consolidation of structure of high noise data by a new noise index and reinforcement learning ⋮ On tropical Kleene star matrices and alcoved polytopes ⋮ Human steering angle estimation in video based on key point detection and Kalman filter ⋮ Point Spread Function Field Learning Based on Optimal Transport Distances ⋮ Optimal detection of the feature matching map in presence of noise and outliers
This page was built for publication: The Hungarian Method for the Assignment Problem
