Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems (Q5086009)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems |
scientific article; zbMATH DE number 7551227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems |
scientific article; zbMATH DE number 7551227 |
Statements
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems (English)
0 references
30 June 2022
0 references
minimum duration paths
0 references
time-dependent travel times
0 references
fastest paths
0 references
time-expanded networks
0 references
time discretization
0 references
dynamic discretization discovery
0 references
0.8483479619026184
0 references
0.8126144409179688
0 references
0.792834997177124
0 references
0.7750914692878723
0 references
0.7700159549713135
0 references
