Maximal Flow with Gains through a Special Network
- 1 June 1972
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 20 (3) , 678-688
- https://doi.org/10.1287/opre.20.3.678
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.Keywords
This publication has 0 references indexed in Scilit: