Dynamic algorithms for recoverable robustness problems
From MaRDI portal
Recommendations
- Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
- Recoverable Robustness in Shunting and Timetabling
- Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
- Recoverable Robust Timetables on Trees
- Evaluation of recoverable-robust timetables on tree networks
Cited in
(13)- Recoverable robustness for train shunting problems
- Recoverable robust periodic timetabling
- Recoverable Robust Timetables on Trees
- Nominal and robust train timetabling problems
- Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Robust algorithms for restricted domains
- Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
- The concept of recoverable robustness, linear programming recovery, and railway applications
- Evaluation of recoverable-robust timetables on tree networks
- Recoverable Robust Combinatorial Optimization Problems
- A survey on robustness in railway planning
- Extending concepts of reliability. Network creation games, real-time scheduling, and robust optimization
This page was built for publication: Dynamic algorithms for recoverable robustness problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917363)
