A Flow Augmentation Approach to the Network with Gains Minimum Cost Flow Problem

P. A. Jensen and Gora Bhaumik
Additional contact information
P. A. Jensen: University of Texas at Austin
Gora Bhaumik: California State University at Fullerton

Management Science, 1977, vol. 23, issue 6, 631-643

Abstract: A network with gains has branches in which the ratio between the flow leaving a branch and the flow entering a branch is a positive constant called the gain. Branch gains may be greater or less than one. Such networks arise in water resources and electrical power planning problems, among others. This paper presents a dual method of finding the minimum cost flows in such a network. Computerized versions of the procedure have been tested on networks with up to 7,000 branches.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.6.631 (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:ormnsc:v:23:y:1977:i:6:p:631-643

Access Statistics for this article

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