Finding the \(K\) shortest paths in a schedule-based transit network (Q1761096)
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: Finding the \(K\) shortest paths in a schedule-based transit network |
scientific article; zbMATH DE number 6106544
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the \(K\) shortest paths in a schedule-based transit network |
scientific article; zbMATH DE number 6106544 |
Statements
Finding the \(K\) shortest paths in a schedule-based transit network (English)
0 references
15 November 2012
0 references
\(K\) shortest paths
0 references
schedule-based transit network
0 references
generalized cost
0 references
time-window constraint
0 references
