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 ...

The maximum availability problem is structured here as a zeroone linear programming problem and solved on a medium-sized transportation network representing Baltimore City. Transportation Science ...