TY - RPRT
A1 - Ruzika, Stefan
A1 - Thiemann, Markus
T1 - Min-Max Quickest Path Problems
N2 - In a dynamic network, the quickest path problem asks for a path such that a given amount of flow can be sent from source to sink via this path in minimal time. In practical settings, for example in evacuation or transportation planning, the problem parameters might not be known exactly a-priori. It is therefore of interest to consider robust versions of these problems in which travel times and/or capacities of arcs depend on a certain scenario. In this article, min-max versions of robust quickest path problems are investigated and, depending on their complexity status, exact algorithms or fully polynomial-time approximation schemes are proposed.
T3 - Report in Wirtschaftsmathematik (WIMA Report) - 130
KW - quickest path
KW - robust network flows
KW - fptas
KW - polynomial algorithms
KW - multiple objective optimization
Y1 - 2010
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2249
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-16676
ER -