Minimum flow problem on network flows with time-varying bounds

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 techn...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied mathematical modelling 2012-09, Vol.36 (9), p.4414-4421
Hauptverfasser:	Salehi Fathabadi, H., Khodayifar, S., Raayatpanah, M.A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Computation Dynamic network flow Mathematical models Minimum flow Minimum flow problem Modelling Networks Reoptimization technique Running
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!