Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14402
For citation please use:
Main Title: Recoverable Robust Shortest Path Problems
Author(s): Puhl, Christina
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15629
http://dx.doi.org/10.14279/depositonce-14402
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Recoverable robustness is a concept to avoid over-conservatism in robust optimization by allowing a limited recovery after the full data is revealed.
Subject(s): recoverable robustness
shortest path
Issue Date: 2008
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2008, 34
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-034-2008.pdf
Format: Adobe PDF | Size: 248.38 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.