Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
β Scribed by Daniel Bienstock; Olga Raskina
- Publisher
- Springer-Verlag
- Year
- 2002
- Tongue
- English
- Weight
- 129 KB
- Volume
- 91
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider a collection of #ows C on 1L labeled by a parameter 50. It is assumed that trajectories of C converge \* uniformly on compact time intervals \* to trajectories of as 0. Extra conditions are determined under which, if has an asymptotically stable equilibrium point, then C has an asymptoti
## Abstract The constrained maximum flow problem is to send the maximum possible flow from a source node s to a sink node t in a directed network subject to a budget constraint that the cost of flow is no more than __D__. In this paper, we consider two versions of this problem: (i) when the cost of