Trip-based path algorithms using the transit network hierarchy (Q298925): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11067-014-9249-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994085259 / rank | |||
Normal rank | |||
Revision as of 17:31, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Trip-based path algorithms using the transit network hierarchy |
scientific article |
Statements
Trip-based path algorithms using the transit network hierarchy (English)
0 references
21 June 2016
0 references
public transit modeling
0 references
network hierarchy
0 references
schedule-based transit network
0 references
shortest path
0 references
hyperpath
0 references
transit \(\mathrm A^*\)
0 references
