Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem (Q2581622)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2244853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem |
scientific article; zbMATH DE number 2244853 |
Statements
Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem (English)
0 references
10 January 2006
0 references
Shortest paths
0 references
Fixed nodes
0 references
Time-dependent
0 references
Travel planning
0 references
0.8214749097824097
0 references
0.7967663407325745
0 references
0.7853176593780518
0 references
0.7820001840591431
0 references
0.7803915739059448
0 references
