A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path (Q2422936): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2017.05.043 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2017.05.043 / rank | |||
Normal rank | |||
Latest revision as of 13:21, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path |
scientific article |
Statements
A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path (English)
0 references
21 June 2019
0 references
railway routing optimization
0 references
graph theory
0 references
Dijkstra algorithm
0 references
railway network
0 references
track gauge
0 references
variable gauge train
0 references
0 references
0 references
