Finding the \(K\) shortest paths in a schedule-based transit network (Q1761096): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2010.02.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048848130 / rank | |||
Normal rank | |||
Revision as of 21:53, 19 March 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
