//-->
A polynomial-time parametric simplex algorithm for the minimum cost network flow problem
Orlin, James B., (1983)
Combinatorial theorems on the simplotope that generalize results on the simplex and cube
Freund, Robert Michael., (1984)
A faster strongly polynomial minimum cost flow algorithm
Orlin, James B., (1988)
New distance-directed algorithms for maximum flow and parametric maximum flow problems
Orlin, James B., (1987)
The complexity of dynamic/periodic languages and optimization problems
Orlin, James B., (1985)