Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem (Q1617289): 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.1007/s10951-017-0535-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2736751709 / rank | |||
Normal rank | |||
Revision as of 00:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem |
scientific article |
Statements
Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem (English)
0 references
7 November 2018
0 references
train routing
0 references
state-dependent shortest path problem
0 references
heuristics
0 references
network
0 references
