| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1704876 | Applied Mathematical Modelling | 2012 | 8 Pages |
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).
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
H. Salehi Fathabadi, S. Khodayifar, M.A. Raayatpanah,