Solving periodic timetable optimisation problems by modulo simplex calculations
From MaRDI portal
Recommendations
- Improving the modulo simplex algorithm for large-scale periodic timetabling
- The Modulo Network Simplex with Integrated Passenger Routing
- Periodic network optimization with different arc frequencies
- Performance of algorithms for periodic timetable optimization
- Forward and line-based cycle bases for periodic timetabling
Cited in
(16)- Disjoint congruence classes and a timetabling application
- Periodic network optimization with different arc frequencies
- Railway timetabling with integrated passenger distribution
- An analysis of the parameterized complexity of periodic timetabling
- An iterative heuristic for passenger-centric train timetabling with integrated adaption times
- Timetabling with passenger routing
- Separation of cycle inequalities in periodic timetabling
- An experimental comparison of periodic timetabling models
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Improving the modulo simplex algorithm for large-scale periodic timetabling
- A matching approach for periodic timetabling
- Integrating passengers' routes in periodic timetabling: a SAT approach
- An improved algorithm for the periodic timetabling problem
- Benders decomposition for the periodic event scheduling problem
- On the split closure of the periodic timetabling polytope
- The tropical and zonotopal geometry of periodic timetables
This page was built for publication: Solving periodic timetable optimisation problems by modulo simplex calculations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917357)
