L. R. Ford
Flows in Networks
1962
A suggested computation for maximal multi-commodity network flows.
1958
Construction of maximal dynamic flows in networks.
1957
Notes on Linear Programming: Part XLI Constructing Maximal Dynamic Flows from Static Flows
1957
Network Flow Theory.
1956
Notes on Linear Programming: Part XXXIV A Primal Dual Algorithm for the Capacitated Hitchcock Problem
1956
Notes on Linear Programming — Part XXXI: A Primal — Dual Algorithm
1956
Notes on Linear Programming — Part XXXII: Solving the Transportation Problem
1956
Notes on Linear Programming: Part XXIX A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
1955
A simple algorithm for finding maximal network flows and an application to the Hitchcock problem.
1955
Maximal Flow through a Network.
1954
Notes on Linear Programming: Part XX Maximal Flow Through a Network
1954