On the complexity of train assignment problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2223 LNCS, Issue , 2001, Pages 390-402

  Erlebach, Thomas ^a   Gantenbein, Martin ^a   Hürlimann, Daniel ^a   Neyer, Gabriele ^b   Pagourtzis, Aris ^c   Penna, Paolo ^a   Schlude, Konrad ^a   Steinhöfel, Kathleen ^d   Taylor, David Scot ^a   Widmayer, Peter ^a  

^a ETH ZURICH   (Switzerland)

^b Transportation Engineers Planners and Economists   (Switzerland)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

^d FRAUNHOFER FIRST   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASSIGNMENT PROBLEMS; COST-EFFICIENT; EFFICIENT METHOD; HARDNESS RESULT; RAILWAY COMPANY; TIME-CONSUMING TASKS;

COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; LOCOMOTIVES; RAILROAD CARS; RAILROAD TRANSPORTATION; ALGORITHMS; COMBINATORIAL OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 35248893431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_34     Document Type: Conference Paper

References (14)

1. P. Alimonti and V. Kann. Hardness of approximating problems on cubic graphs. In Proc. 3rd Italian Conference on Algorithms and Complexity, LNCS 1203, pages 288-298, Berlin, 1997. Springer-Verlag. 396, 399
2. A. Bertossi, P. Carraresi, and G. Gallo. On some matching problems arising in vehicle scheduling models. Networks, 17:271-281, 1987. 394, 395, 396
3. P. Brucker, J.L. Hurink, and T. Rolfes. Routing of railway carriages: A case study. Memorandum No. 1498, University of Twente, Fac. of Mathematical Sciences, 1999. 394
4. M.R. Bussieck, T. Winter, and U.T. Zimmermann. Discrete optimization in public rail transport. Mathematical Programming, 79:415-444, 1997. 394
5. G. Carpaneto, M. Dell'Amico, M. Fischetti, and P. Toth. A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks, 19:531-548, 1989. 394
6. P. Crescenzi and L. Trevisan. On approximation scheme preserving reducibility and its applications. In Proc. 14th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 880, pages 330-341, Berlin, 1994. Springer-Verlag. 399
7. G. Dantzig and D. Fulkerson. Minimizing the number of tankers to meet a fixed schedule. Nav. Res. Logistics Q., 1:217-222, 1954. 394, 396
8. J. Desrosiers, Y. Dumas, M.M. Solomon, and F. Soumis. Time Constrained Routing and Scheduling. Elsevier, 1995. 394
9. T. Erlebach, M. Gantenbein, D. Hürlimann, G. Neyer, A. Pagourtzis, P. Penna, K. Schlude, K. Steinhöfel, D.S. Taylor, and P. Widmayer. On the complexity of train assignment problems. Technical report, Swiss Federal Institute of Technology Zürich (ETH), 2001. Available at http://www.inf.ethz.ch/. 395
10. R. Freling, J.M.P. Paixão, and A.P.M. Wagelmans. Models and algorithms for vehicle scheduling. Report 9562/A, Econometric Institute, Erasmus University Rotterdam, 1999. 394
11. A. Löbel. Optimal vehicle scheduling in public transit. PhD thesis, TU Berlin, 1998. 394
12. C. Papadimitriou and M. Yannakakis. Optimization, approximization and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991. 396, 399
13. C. Ribeiro and F. Soumis. A column generation approach to the multiple-depot vehicle scheduling problem. Operations Research, 42(1):41-52, 1994. 394
14. A. Schrijver. Minimum circulation of railway stock. CWI Quarterly, 6(3):205-217, 1993. 394