EconPapers    
Economics at your fingertips  
 

Maximal Flow with Gains through a Special Network

John J. Jarvis and Anthony M. Jezior
Additional contact information
John J. Jarvis: Georgia Institute of Technology, Atlanta, Georgia
Anthony M. Jezior: Office of the Assistant Vice Chief of Staff, United States Army, Washington, D.C.

Operations Research, 1972, vol. 20, issue 3, 678-688

Abstract: This paper uses the special structure at a (directed) acyclic network with positive gains to develop an extremely simple and powerful algorithm for maximal flow. Finiteness of the algorithm is achieved through a theorem characterizing basic solutions for this special network.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.3.678 (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:20:y:1972:i:3:p:678-688

Access Statistics for this article

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

 
Page updated 2025-03-19
Handle: RePEc:inm:oropre:v:20:y:1972:i:3:p:678-688