Back to Search
Start Over
Maximum flow problem on dynamic generative network flows with time-varying bounds
- Source :
-
Applied Mathematical Modelling . Aug2010, Vol. 34 Issue 8, p2136-2147. 12p. - Publication Year :
- 2010
-
Abstract
- Abstract: This paper considers a new class of network flows, called dynamic generative network flows in which, the flow commodity is dynamically generated at a source node and dynamically consumed at a sink node and the arc-flow bounds are time dependent. Then the maximum dynamic flow problem in such networks for a pre-specified time horizon T is defined and mathematically formulated in both arc flow and path flow presentations. By exploiting the special structure of the problem, an efficient algorithm is developed to solve the general form of the dynamic problem as a minimum cost static flow problem. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0307904X
- Volume :
- 34
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- Applied Mathematical Modelling
- Publication Type :
- Academic Journal
- Accession number :
- 48893917
- Full Text :
- https://doi.org/10.1016/j.apm.2009.10.026