A phase I simplex method for finding feasible periodic timetables
From MaRDI portal
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
- A cut-based heuristic to produce almost feasible periodic railway timetables
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)