Minimum flow problem on network flows with time-varying bounds |
| |
Authors: | H Salehi Fathabadi S Khodayifar MA Raayatpanah |
| |
Institution: | School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran |
| |
Abstract: | In this paper, we consider the minimum flow problem on network flows in which the lower arc capacities vary with time. We will show that this problem for set {0, 1, … , T} of time points can be solved by at most n minimum flow computations, by combining of preflow-pull algorithm and reoptimization techniques (no matter how many values of T are given). Running time of the presented algorithm is O(n2m). |
| |
Keywords: | Minimum flow problem Dynamic network flow Reoptimization technique |
本文献已被 ScienceDirect 等数据库收录! |
|