A shortest augmenting path algorithm for dense and sparse linear assignment problems

A note on two problems in connexion with graphs

E. Dijkstra · Numerische Mathematik · 1959 · 23.5K citations

Mathematical Programming, Graph Minor, Engineering +7

The Hungarian method for the assignment problem

Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.2K citations

Mathematical Programming, Engineering, Numerical Scores +13

Combinatorial Optimization: Algorithms and Complexity.

David Johnson, Christos H. Papadimitriou, Kenneth Steiglitz · American Mathematical Monthly · 1984 · 6K citations

Mathematical Programming, Engineering, Algorithm Design +15

Combinatorial optimization:Algorithms and complexity

L. R. Rabiner · IEEE Transactions on Acoustics Speech and Signal Processing · 1984 · 3.6K citations

Engineering, Combinatorial Problem, Computational Complexity +4

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Jack Edmonds, Richard M. Karp · Journal of the ACM · 1972 · 2.5K citations

Network Flow Problems, Theoretical Improvements, Engineering +19