Back to Search
Start Over
Maximal Flow with Gains through a Special Network.
- Source :
- Operations Research; May/Jun72, Vol. 20 Issue 3, p678-688, 11p
- Publication Year :
- 1972
-
Abstract
- This paper uses the special structure of 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0030364X
- Volume :
- 20
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 8604289
- Full Text :
- https://doi.org/10.1287/opre.20.3.678