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
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Integration of DEA and AHP with computer simulation for railway system improvement and optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on two problems in connexion with graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The directed subgraph homeomorphism problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new probabilistic extension of Dijkstra's algorithm to simulate more realistic traffic flow in a smart city / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4495163 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dijkstra's algorithm on-line / rank | |||
Normal rank |
Revision as of 15:02, 19 July 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