 |
|
|||
| Authors: | Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer |
| Group: | Theory of Communication Networks |
| Type: | Inproceedings |
| Title: | On the complexity of train assignment problems |
| Year: | 2001 |
| Month: | December |
| Pub-Key: | E+01 |
| Book Titel: | Lecture Notes in Computer Science. Proceedings of the Twelfth Annual International Symposium on Algorithms and Computation (ISAAC 01) |
| Volume: | 2223 |
| Pages: | 390-402 |
| Abstract: | 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 time-consuming 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. |
| Location: | Christchurch, New Zealand |
| Resources: | [BibTeX] |
