Publikationsdatum:
2020-08-05
Beschreibung:
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.
Sprache:
Englisch
Materialart:
conferenceobject
,
doc-type:conferenceObject