This paper establishes a basic relationship between the max flow problem in networks with positive gains and the min-cost flow problem in pure networks. The result unifies the theory which to date has ...

Computer scientists at ETH Zurich have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum ...

This note contains an O(n log n) time-bounded implementation and extentions for a procedure developed by Sidney for the two-machine maximum flow time problem with series-parallel precedence ...