Calculating Maximal Flows in a Network with Positive Gains
- 1 April 1973
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 21 (2) , 528-541
- https://doi.org/10.1287/opre.21.2.528
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: