Sciweavers

Share
ISAAC
2001
Springer

On the Complexity of Train Assignment Problems

12 years 2 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions by hand, a timeconsuming task which is too slow for interaction with the schedule creators. Further, it is difficult to measure how efficient the manual solutions are. We consider several variants of the problem. For some, we give efficient methods to solve them optimally, while for others, we prove hardness results and propose approximation algorithms.
Thomas Erlebach, Martin Gantenbein, Daniel Hü
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2001
Where ISAAC
Authors Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
Comments (0)
books