Recoverable Robust Shortest Path Problems

dc.contributor.authorPuhl, Christina
dc.date.accessioned2021-12-17T10:07:42Z
dc.date.available2021-12-17T10:07:42Z
dc.date.issued2008
dc.description.abstractRecoverable robustness is a concept to avoid over-conservatism in robust optimization by allowing a limited recovery after the full data is revealed.en
dc.identifier.issn2197-8085
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/15629
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-14402
dc.language.isoenen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.ddc510 Mathematiken
dc.subject.otherrecoverable robustnessen
dc.subject.othershortest pathen
dc.titleRecoverable Robust Shortest Path Problemsen
dc.typeResearch Paperen
dc.type.versionsubmittedVersionen
tub.accessrights.dnbfreeen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften>Inst. Mathematikde
tub.affiliation.facultyFak. 2 Mathematik und Naturwissenschaftende
tub.affiliation.instituteInst. Mathematikde
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber2008, 34en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen
Files
Original bundle
Now showing 1 - 1 of 1
Loading…
Thumbnail Image
Name:
Report-034-2008.pdf
Size:
248.38 KB
Format:
Adobe Portable Document Format
Description:
Collections