Operations Research · 1966 · 178 citations · 5 references
Natural SciencesComputer ScienceOptimizationCombinatorial OptimizationNetwork Flow AlgorithmsNetwork FlowsNetwork OptimizationNetwork ProgrammingLarge-scale Linear ProgrammingMinimum Cost FlowMinimum-cost Flow AlgorithmsMinimum-cost Flow ProblemMulti-commodity FlowMulticommodity FlowNetwork Flow FormulationsNetwork Flow Problems
The minimum-cost multicommodity network flow problem is formulated in both node-arc and arc-chain form, leading to very large linear programs. The special structure of these programs is utilized in algorithms for their solution.
5
The Decomposition Algorithm for Linear Programs
George B. Dantzig, Philip Wolfe · Econometrica · 1961 · 749 citations
T. C. Hu · Operations Research · 1963 · 393 citations
Some aspects of the urban traffic assignment problem
Niels O Jörgensen · 1963 · 57 citations