Sciweavers

ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
13 years 8 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 b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...