On Kuhn's Hungarian Method?A tribute from Hungary

DOI10.1002/nav.20056zbMath1140.90500OpenAlexW2126045901WikidataQ56987183 ScholiaQ56987183MaRDI QIDQ4680450

András Frank

Publication date: 1 June 2005

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20056

zbMATH Keywords

efficient algorithmsHungarian Methodweighted bipartite matchings

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) History of mathematics in the 20th century (01A60) Discrete location and assignment (90B80) History of operations research and mathematical programming (90-03)

Related Items (8)

Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking ⋮ Assignment problems: a golden anniversary survey ⋮ A local interaction dynamic for the matching problem ⋮ Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication ⋮ Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ Editorial: Computational advances in combinatorial optimization ⋮ Max-Balanced Hungarian Scalings

Cites Work

• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: On Kuhn's Hungarian Method?A tribute from Hungary