Finding the \(K\) shortest paths in a schedule-based transit network (Q1761096): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TransCAD / rank | |||
Normal rank | |||
Revision as of 04:49, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the \(K\) shortest paths in a schedule-based transit network |
scientific article |
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
