A phase I simplex method for finding feasible periodic timetables

DOI10.4230/OASICS.ATMOS.2021.6zbMATH Open1548.90074MaRDI QIDQ6587281FDOQ6587281

Authors: Marc Goerigk, Anita Schöbel, Felix Spühler 

Publication date: 13 August 2024

Recommendations

• Improving the modulo simplex algorithm for large-scale periodic timetabling
• A matching approach for periodic timetabling
• Solving the periodic scheduling problem: an assignment approach in non-periodic networks
• Periodic railway timetabling with event flexibility
• Experimental and Efficient Algorithms

zbMATH Keywords

periodic event scheduling problemmodulo simplextrain timetable optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

This page was built for publication: A phase I simplex method for finding feasible periodic timetables

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