A transportation flow algorithm is, for example, an algorithm that finds the fastest and cheapest route to transport as many goods as possible from Tokyo to Osaka.

We present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s-t cut problems. The two algorithms were tested on several ...

Given all bij, there is a maximum flow from Ni to Nj using all arcs. Under the assumption that bij=bji, the present paper generalizes the max-flow min-cut theorem of Ford and Fulkerson to the problem ...