Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem (Q1617289)
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: Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem |
scientific article; zbMATH DE number 6974909
| 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; zbMATH DE number 6974909 |
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
0.8070736527442932
0 references
0.7780869007110596
0 references
0.7762930393218994
0 references
0.7720637917518616
0 references
0.7653956413269043
0 references