1. Abril, M., Barber, F., Ingolotti, L., Lova, A., Salido, M. A., & Tormos, P. (2004). An efficient method to schedule new trains on a heavily loaded railway network. In C. Lemaîitre, C. A. Reyes, & J. A. González (Eds.), Advances in Artificial Intelligence—IBERAMIA 2004 (Vol. 3315, pp. 164–173)., Lecture Notes in Computer Science Berlin Heidelberg: Springer.
2. Burdett, R. L., & Kozan, E. (2009). Techniques for inserting additional trains into existing timetables. Transportation Research Part B: Methodological, 43(8–9), 821–836.
3. Bussieck, M. R. (1998). Optimal lines in public rail transport. PhD thesis, Technische Universität Braunschweig, Germany.
4. Bussieck, M. R., Winter, T., & Zimmermann, U. T. (1997). Discrete optimization in public rail transport. Mathematical Programming, 79(1–3), 415–444.
5. Cacchiani, V., Caprara, A., & Toth, P. (2010a). Non-cyclic train timetabling and comparability graphs. Operations Research Letters, 38(3), 179–184.