Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
From MaRDI portal
Publication:454883
Recommendations
- Recoverable Robustness in Shunting and Timetabling
- Dynamic algorithms for recoverable robustness problems
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- The concept of recoverable robustness, linear programming recovery, and railway applications
- Evaluation of recoverable-robust timetables on tree networks
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 663895 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- A survey of metaheuristic-based techniques for university timetabling problems
- Adjustable robust solutions of uncertain linear programs
- Algorithm Theory - SWAT 2004
- Computing delay resistant railway timetables
- Dynamic algorithms for recoverable robustness problems
- Introduction to Stochastic Programming
- Light robustness
- Optimization models for the single delay management problem in public transportation
- Recoverable Robustness in Shunting and Timetabling
- Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
- Recoverable robustness for train shunting problems
- Robust convex optimization
- Robust optimization
- Robust optimization - a comprehensive survey
- Robust optimization for empty repositioning problems
- Robust solutions of linear programming problems contaminated with uncertain data
- The Price of Robustness
- The concept of recoverable robustness, linear programming recovery, and railway applications
Cited in
(6)- Recoverable robustness by column generation
- Generalized light robustness and the trade-off between robustness and nominal quality
- Decomposition approaches for recoverable robust optimization problems
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Dynamic algorithms for recoverable robustness problems
- The concept of recoverable robustness, linear programming recovery, and railway applications
This page was built for publication: Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454883)