Delay Management Problem: Complexity Results and Robust Algorithms
From MaRDI portal
Publication:5505683
Recommendations
Cites work
Cited in
(20)- Robust train routing and online re-scheduling
- Robust algorithms and price of robustness in shunting problems
- Graph-Theoretic Concepts in Computer Science
- Recoverable Robust Timetables on Trees
- Algorithm Theory - SWAT 2004
- Determining operations affected by delay in predictive train timetables
- Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
- Delay-robust event scheduling
- An experimental investigation of a primal-dual exterior point simplexalgorithm
- Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization
- Recoverable robust timetable information
- The price of robustness in timetable information
- Engineering graph-based models for dynamic timetable information systems
- Computing delay resistant railway timetables
- Evaluation of recoverable-robust timetables on tree networks
- A bicriteria approach for robust timetabling
- A survey on robustness in railway planning
- Entry and Exit Decision Problem with Implementation Delay
- Extending concepts of reliability. Network creation games, real-time scheduling, and robust optimization
- An empirical analysis of robustness concepts for timetabling
This page was built for publication: Delay Management Problem: Complexity Results and Robust Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505683)