CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Recoverable Robust Shortest Path Problems
Authors
Christina Puhl
Publication date
1 January 2008
Publisher
Doi
Cite
Abstract
Recoverable robustness is a concept to avoid over-conservatism in robust optimization by allowing a limited recovery after the full data is revealed
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
DepositOnce
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:depositonce.tu-berlin.de:1...
Last time updated on 25/12/2021