Thumbnail Image
🆕 Date Issued:
2008
🗄 In DepositOnce:2021-12-17
Submitted Version

Please use this identifier to cite or link to this item:

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.
recoverable robustnessshortest path
In Copyright
Full item page