Recoverable Robust Shortest Path Problems
Puhl, Christina
Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Recoverable robustness is a concept to avoid over-conservatism in robust optimization by allowing a limited recovery after the full data is revealed.
