Time-dependent Shortest Paths
Time-Dependent Shortest Paths is a shortest path problem variant in which the travel time along each edge of a graph varies as a function of the departure time, thereby requiring the determination of an optimal source-to-destination route that accounts for time-varying edge weights.
203
Publications
16.7K
Citations
495
Authors
239
Institutions
Publications per year
2017–2026
60
Variants
Time-dependent Shortest Path Problem
Parents
203
Richard Bellman · Quarterly of Applied Mathematics · 1958 · 2.7K citations · Full text
An Appraisal of Some Shortest-Path Algorithms
Stuart E. Dreyfus · Operations Research · 1969 · 997 citations
1–5 of 203
495
8
h-index
7
h-index
5
h-index
Hong Kong Polytechnic University, Hong Kong SAR China
4 publications · 252 citations
4
h-index
4
h-index
1–5 of 495
239
Eindhoven University of Technology
Eindhoven, The Netherlands
9 h-index
20 publications
2.9K citations
University of Maryland, College Park
College Park, United States
7 h-index
16 publications
917 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
6 h-index
12 publications
574 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
8 publications
883 citations
University of Arizona
Tucson, United States
5 h-index
11 publications
408 citations
Tsinghua University
Beijing, China
5 h-index
12 publications
1.2K citations
Beijing Jiaotong University
Beijing, China
5 h-index
11 publications
176 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
5 h-index
10 publications
1.1K citations
1–8 of 239
16 publications · 1.2K citations
15
h-index
11 publications · 1.1K citations
11
h-index
11 publications · 1.5K citations
11
h-index
9 publications · 647 citations
9
h-index
TRR · 9 publications · 433 citations
9
h-index
1–5