Determining all integer vertices of the PESP polytope by flipping arcs

DOI10.4230/OASICS.ATMOS.2020.5MaRDI QIDQ6587161zbMATH OpenFDO

Authors Niels Lindner, Christian Liebchen

Publication date 13 August 2024

zbMATH Keywords

mixed integer programmingperiodic timetablingperiodic event scheduling problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• Forward and line-based cycle bases for periodic timetabling
• Separation of cycle inequalities for the periodic timetabling problem
• Separation of cycle inequalities in periodic timetabling
• The second Chvátal closure can yield better railway timetables
• A matching approach for periodic timetabling

This page was built for publication: Determining all integer vertices of the PESP polytope by flipping arcs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587161)