The following pages link to Exact train pathing (Q835603):
Displaying 7 items.
- Waiting for trains: complexity results (Q779218) (← links)
- \(k\)-shortest routing of trains on shunting yards (Q841591) (← links)
- The Merlin-Randell problem of train journeys (Q1062925) (← links)
- Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem (Q1617289) (← links)
- A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path (Q2422936) (← links)
- A Model, Algorithms and Strategy for Train Pathing (Q4849315) (← links)
- Nondecreasing paths in a weighted graph or: how to optimally read a train schedule (Q6486953) (← links)
