@conference{TAPAS2011-goerigk,
author = "Marc Goerigk and Anita Sch{\"o}bel",
abstract = "Finding robust solutions of an optimization problem is an important issue in practice. The established concept of Ben-Tal et al. requires that a robust solution is feasible for all possible scenarios. However, this concept is very conservative and hence may lead to solutions with a bad objective value and is in many cases hard to solve. Thus it is not suitable for most practical applications. In this paper we suggest an algorithm for calculating robust solutions that is easy to implement and not as conservative as the strict robustness approach. We show some theoretical properties of our approach and evaluate it using linear programming problems from NetLib? .",
booktitle = "The 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS)",
note = "to appear",
series = "LNCS",
title = "{A} {S}cenario-{B}ased {A}pproach for {R}obust {L}inear {O}ptimization",
year = "2011",
}