TY - INPR
A1 - Hamacher, Horst W.
A1 - Ruzika, Stefan
A1 - Tjandra, Stevanus A.
T1 - Algorithms for Time-Dependent Bicriteria Shortest Path Problems (revised version)
N2 - In this paper we generalize the classical shortest path problem in two ways. We consider two objective functions and time-dependent data. The resulting problem, called the time-dependent bicriteria shortest path problem (TdBiSP), has several interesting practical applications, but has not gained much attention in the literature.
T3 - Report in Wirtschaftsmathematik (WIMA Report) - 89 rev.
KW - Multiple criteria optimization
KW - label setting algorithm
KW - time-dependent shortest path problem
KW - bicriteria shortest path problem
Y1 - 2004
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1581
UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-15811
ER -