Maximum flow problem on dynamic generative network flows with time-varying bounds |
| |
Authors: | Hassan Salehi Fathabadi Seyed Ahmad Hosseini |
| |
Affiliation: | School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran |
| |
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. |
| |
Keywords: | Network/graphs Dynamic flows LP problems Decomposition methods |
本文献已被 ScienceDirect 等数据库收录! |