A concurrent approach to the periodic event scheduling problem

Borndörfer, 2019, Separation of cycle inequalities in periodic timetabling, Discrete Optim. Gleixner, 2018 Goerigk, M., Liebchen, C., 2017. An improved algorithm for the periodic timetabling problem. In: 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Vol. 59. ATMOS 2017. pp. 12:1–12:14. Goerigk, 2013, Evaluating line concepts using travel times and robustness: Simulations with the Lintim toolbox, Publ. Transp., 5, 267, 10.1007/s12469-013-0072-x Goerigk, 2013, Improving the modulo simplex algorithm for large-scale periodic timetabling, Comput. Oper. Res., 40, 1363, 10.1016/j.cor.2012.08.018 Großmann, 2016 Großmann, 2012, Solving periodic event scheduling problems with SAT, 166 Horton, 1987, A polynomial–time algorithm to find the shortest cycle basis of a graph, SIAM J. Comput., 16, 359, 10.1137/0216026 Kümmling, 2015, A state-of-the-art realization of cyclic railway timetable computation, Publ. Transp., 7, 281, 10.1007/s12469-015-0108-5 Liebchen, 2006 Liebchen, 2008, The first optimized railway timetable in practice, Transp. Sci., 42, 420, 10.1287/trsc.1080.0240 Liebchen, 2006 Liebchen, 2009, Integral cycle bases for cyclic timetabling, Discrete Optim., 6, 98, 10.1016/j.disopt.2008.09.003 Martins, 2014, 438 Nachtigall, 1998 Nachtigall, K., Opitz, J., 2008. Solving periodic timetable optimisation problems by modulo simplex calculations. In: 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Vol. 9. ATMOS ’08. Odijk, 1994 Roth, 2019 Serafini, 1989, A mathematical model for periodic scheduling problems, SIAM J. Discrete Math., 2, 550, 10.1137/0402049