Shortest paths in piecewise continuous time-dependent networks (Q2517795)
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: Shortest paths in piecewise continuous time-dependent networks |
scientific article; zbMATH DE number 5488548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest paths in piecewise continuous time-dependent networks |
scientific article; zbMATH DE number 5488548 |
Statements
Shortest paths in piecewise continuous time-dependent networks (English)
0 references
9 January 2009
0 references
shortest path
0 references
time-dependent travel times
0 references
algorithms
0 references
0.93866456
0 references
0.91183066
0 references
0.9116704
0 references
0.9114321
0 references
0.90837324
0 references
0.90571046
0 references
0.9045526
0 references
0.9021618
0 references