Calculating Maximal Flows in a Network with Positive Gains

Richard C. Grinold
Additional contact information
Richard C. Grinold: University of California, Berkeley, California

Operations Research, 1973, vol. 21, issue 2, 528-541

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.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.2.528 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:21:y:1973:i:2:p:528-541

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().