Time depending shortest-path problems with applications to railway networks (Q1388936)
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: Time depending shortest-path problems with applications to railway networks |
scientific article; zbMATH DE number 1162960
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time depending shortest-path problems with applications to railway networks |
scientific article; zbMATH DE number 1162960 |
Statements
Time depending shortest-path problems with applications to railway networks (English)
0 references
5 January 1999
0 references
networks
0 references
shortest paths
0 references
transportation
0 references
rail
0 references
time depending transit network
0 references
public transport
0 references
label correcting method
0 references
