GENERATING DENSE RAILWAY SCHEDULES 1. Introduction

Generating dense railway schedules 297
References
[1] G. Caimi, D. Burkolter, and T. Herrmann. Finding delay-tolerant train routings through
stations. In Operations Research Proceedings 2004. Springer, 2005.
[2] A. Caprara, M. Fischetti, P. L. Guida, M. Monaci, G. Sacco, and P. Toth. Solution of
real-world train timetabling problems. In HICSS, 2001.
[3] M. Cochand. A fixed point operator for the generalised maximum satisfiability problem.
Discrete Applied Mathematics, 46:117–132, 1993.
[4] J. Cochet-Terrasson, G. Cohen, S. Gaubert, M. McGettrick, and J.-P. Quadrat. Numerical
computation of spectral elements in max-plus algebra. In IFAC Conference on
System Structure and Control, Nantes, France, 1998.
[5] R. Goverde and G. Soto y Koelemeijer. Performance Evaluation of Periodic Railway
Timetables: Theory and Algorithms. Number S2000/2 in Trail Studies in Transportation
Science Series. The Netherlands TRAIL Research School, Delft, 2000.
[6] C. Liebchen and R. H. Möhring. The modeling power of the periodic event scheduling
problem: Railway timetables—and beyond. Technical report, TU Berlin, 2004.
[7] T. Lindner and U. Zimmermann. Train schedule optimization in public rail transport.
In Mathematics—Key Technology for the Future: Joint Projects Between Universities
and Industry, pages 703–716. Springer, 2003.
[8] P. Serafini and W. Ukovich. A mathematical model for periodic scheduling problems.
SIAM Journal on Discrete Mathematics, 2(4), 1989.
[9] P. J. Zwaneveld, L. G. Kroon, H. E. Romeijn, and M. Salomon. Routing trains through
railway stations: Model formulation and algorithms. Transportation Science, 30(3):181–
194, 1996.