Wing
Network Flow
1950s
Hungarian Algorithm
Harold Kuhn, 1955
Solves the assignment problem by finding the optimal one-to-one matching that minimizes total cost in a cost matrix.
Ford-Fulkerson (Max Flow)
L.R. Ford Jr. & D.R. Fulkerson, 1956
Computes maximum flow in a network by repeatedly finding augmenting paths and pushing flow along them.