TY - CONF A1 - Borndörfer, Ralf A1 - Hoppmann, Heide A1 - Karbstein, Marika T1 - Separation of Cycle Inequalities for the Periodic Timetabling Problem T2 - 24th Annual European Symposium on Algorithms (ESA 2016) N2 - Cycle inequalities play an important role in the polyhedral study of the periodic timetabling problem. We give the first pseudo-polynomial time separation algorithm for cycle inequalities, and we give a rigorous proof for the pseudo-polynomial time separability of the change-cycle inequalities. The efficiency of these cutting planes is demonstrated on real-world instances of the periodic timetabling problem. Y1 - 2016 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/6025 VL - 57 ER -