The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
By Christian Liebchen, Marco E. Lübbecke, R. Möhring, S. Stiller. Robust and Online Large-Scale Optimization, 2009
339 citations recorded by the source corpus.
Subfields: Industrial and Manufacturing Engineering, Transportation
View Paper: https://www.semanticscholar.org/paper/7b80cc73b4ded163f181c1ce1b62fae47db6f418
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Industrial and Manufacturing Engineering
- Kathrin Klamroth
- Anita Schöbel
- Paolo Toth
- Gilbert Laporte
- Michel Gendreau
- Stefan Røpke
- David Pisinger
- Teodor Gabriel Crainic
In Transportation
Citations in the corpus
- Recent advances in robust optimization: An overview (2014, background): “…models and algorithms that arise from implementing recoverable robust optimization to train platforming and rolling stock planning, where the concept of recoverable robustness has been defined in Liebchen et al. (2009) as the ability to recover a given solution by limited means in all scenarios.”
- Railway Track Allocation: Models and Algorithms (2012, neutral): “(2009) [152] apply these robust considerations to the world of”
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals (2013, methodology): “Several other concepts of robustness were introduced more recently, e.g. the concept of light robustness by Fischetti and Monaci [3] or the concept of recovery robustness in Liebchen et al. A scenario-based approach is suggested in Goerigk and Schöbel [4].”
- Line planning in public transportation: models and methods (2012, background): “In particular, for optimization of public transportation, new concepts to analyze robustness of a plan and to develop robust plans have been proposed; see the concepts of recovery robustness (Liebchen et al. 2009; Erera et al. 2009; Cicerone et al. 2009) and of light robustness (Fischetti and Monaci”
- Nominal and robust train timetabling problems (2012, background): “(see [27]) introduced another new general concept, which is called recoverable robustness: it combines the optimization of the planning phase with the strategy of recovery and can successfully applied to TTP.”