Algorithms and concepts for robust optimization

Goerigk, Marc (2013) Algorithms and concepts for robust optimization. PhD thesis, UNSPECIFIED.

Full text not available from this repository.


In this work we consider uncertain optimization problems where no probability distribution is known. We introduce the approaches RecFeas and RecOpt to such a robust optimization problem, using a location theoretic point of view, and discuss both theoretical and algorithmic aspects. We then consider both continuous and discrete problem applications of robust optimization: Linear programs from the Netlib benchmark set, and the aperiodic timetabling problem on the continuous side; intermodal load planning, Steiner trees, periodic timetabling, and timetable information on the discrete side. Finally, we present the software library ROPI as a framework for robust optimization with support for most established mixed-integer programming solvers.

Item Type:
Thesis (PhD)
ID Code:
Deposited By:
Deposited On:
10 Nov 2015 09:52
Last Modified:
12 Sep 2023 00:16