Abstract
In this chapter, we present the results of our approximate robust optimization framework for different benchmarks sets. We compare them to the results obtained for the exact quadratic formulation of the robust problems with respect to different performance measures. Special focus is put on the quality of the approximate solution in relation to the time needed to compute it.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Bärmann, A. (2016). Computational Assessment of Approximate Robust Optimization. In: Solving Network Design Problems via Decomposition, Aggregation and Approximation . Springer Spektrum, Wiesbaden. https://doi.org/10.1007/978-3-658-13913-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-658-13913-1_13
Published:
Publisher Name: Springer Spektrum, Wiesbaden
Print ISBN: 978-3-658-13912-4
Online ISBN: 978-3-658-13913-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)