|Publication ahead of print|
RAIRO-Theor. Inf. Appl.
|Published online||11 July 2018|
Minimum parametric flow in time-dependent dynamic networks
Andrei Şaguna National College,
Şirul Mitropolit Andrei Şaguna 1,
2 Transilvania University of Braşov, Bulevardul Eroilor 29, Braşov 500036, Romania
* Corresponding author: email@example.com
Accepted: 20 February 2018
The paper presents a dynamic solution method for the parametric minimum flow in time-dependent, dynamic network. This approach solves the problem for a special parametric dynamic network with linear lower bound functions of a single parameter. Instead of directly working in the original network, the method implements a labelling algorithm which works in the parametric dynamic residual network where repeatedly decreases the flow along quickest dynamic source-sink paths for different subintervals of parameter values, in their increasing order. In each iteration, the algorithm computes both the parametric minimum flow within a certain subinterval, and the new subinterval for which the flow needs to be computed.
Mathematics Subject Classification: 05C85 / 68R10 / 90C47
Key words: Dynamic network / parametric flow / shortest paths
© 2018, EDP Sciences
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.