Calculating Maximal Flows in a Network with Positive Gains

This paper looks at the maximal-flow-with-gains problem from a new point of view. We with to discover the maximum output possible for any input. This approach leads naturally to a two-step parametric solution procedure: The first step finds the maximum output for zero input, and resolves all difficulties with flow-generating loops; the second determines how the maximum output increases as input is increased.