A Note on Parametric Network Flows
TLDR
Doulliez and Rao as mentioned in this paper presented algorithms that solve two flow problems for a single source, multi-terminal network, where the demand at each sink is a nondecreasing, linear function of t. The proofs are based on the well known fact that a network possesses only a finite number of different spanning trees.Abstract:
In their paper [Doulliez, P. J., M. R. Rao. 1971. Maximal flow in a multi-terminal network with any one are subject to failure. Management Sci.18 1, September 48--58.], Doulliez and Rao present algorithms that solve two flow problems for a single source, multi-terminal network. The first problem that they solve is the construction of a flow that maximizes the value of t, where the demand at each sink is a nondecreasing, linear function of t. Given such a flow, the second problem that they solve is the construction of a flow that maximizes the value of t when the capacity of an arc is reduced. This paper supplies a finiteness proof for the first algorithm and sketches a finiteness proof for the second algorithm. The proofs are based on the well-known fact that a network possesses only a finite number of different spanning trees.read more
Citations
More filters
Journal ArticleDOI
Parametric Network Flows
TL;DR: Two algorithms that determine the range of values for the parameter t are presented that correspond to the primal and dual linear-programming algorithms that solve the problem of directed capacitated network solving.
Journal ArticleDOI
Parametric studies in transportation‐type problems
C. O. Fong,M. R. Rao +1 more
TL;DR: Some results in parametric studies are presented on several transportation-type problems, and a characterization is obtained for the optimal values of the variables in the problem of determining an optimal growth path in a logistics system.
Journal ArticleDOI
Engpässe, Staustellen und glatte homogene Ströme in Netzen
TL;DR: Ford/Fulkerson's fundamental dualistic max-flow min-cut concept does not apply if lower bounds on arc flows can no longer be excluded because iff-conditions are proved under which a cut between source and sink has a minimal net capacity.
References
More filters
Journal ArticleDOI
Maximal Flow in a Multi-Terminal Network with Any One Arc Subject to Failure
Pierre J. Doulliez,M. R. Rao +1 more
TL;DR: In this paper two methods are given for solving the problem of finding the maximum time up to which all demands can be satisfied in a multi-terminal network when the arc capacities are specified.