Robust Optimization Algorithms
Description
Prof. Dr. Anita Schöbel; Georg-August-Universität Göttingen
Project website
An exact optimal solution for an optimization problem is often useless for practical applications if the assumptions change or if unforeseen events occur. This is a reason for the gap between theory and practice in optimization. In the project Robust Optimization Algorithms we aim at improving this situation by developing robust algorithms which are applicable in practice. To this end it is necessary to adapt the robustness concepts and the algorithms to the problem instance and to the uncertainty type found in the data.
Publications
- M. Goerigk and A. Schöbel. "Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem". Proc. of the 10th International Symposium on Experimental Algorithms (SEA 11). P. M. Pardalos and S. Rebennack eds. 2011. pp. 181-192. [More]
- M. Goerigk and A. Schöbel. "A Scenario-Based Approach for Robust Linear Optimization". The 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS). 2011. [More]
- A. Schöbel. "Controlling the level of robustness in timetabling and scheduling: A bicriterias approach". Proceedings of the TRISTAN VII conference. G. Hasle ed. 2010. pp. 689-693. [More]
- M. Goerigk and A. Schöbel. "An Empirical Analysis of Robustness Concepts for Timetabling". Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. T. Erlebach and M. Lübbecke eds. 2010. pp. 100-113. [More]
- A. Schöbel. "Light Robustness and the trade-off between robustness and nominal quality". Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen. 2010. [More]