## Separation of Cycle Inequalities for the Periodic Timetabling Problem

• 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.

Author: Ralf Borndörfer, Heide Hoppmann, Marika Karbstein In Proceedings 24th Annual European Symposium on Algorithms (ESA 2016) 57 Leibniz International Proceedings in Informatics (LIPIcs) 2016 http://dx.doi.org/10.4230/LIPIcs.ESA.2016.21

$Rev: 13581$