Zur Hauptnavigation / To main navigation

Zur Sekundärnavigation / To secondary navigation

Zum Inhalt dieser Seite / To the content of this page

Hauptnavigation / Main Navigation

Sekundärnavigation / Secondary navigation

Dr. André Chassein

Inhaltsbereich / Content

Dr. André Chassein

Technische Universität Kaiserslautern
Fachbereich Mathematik
Postfach 3049
67653 Kaiserslautern

E-Mail: chassein[at]mathematik.uni-kl.de
Dr. André Chassein


Research Interests 

  • Robust Optimization
  • Complexity Theory
  • Combinatorial Optimization
  • Inverse Location Theory


Journal Publications

Book Chapters

  • A. Chassein and M. Goerigk. Performance Analysis in Robust Optimization. In Doumpos, M., Zopounidis, C., and Grigoroudis, E. (eds), Robustness Analysis in Decision Aiding, Optimization, and Analytics, International Series in Operations Research & Management Science, Springer, 2016.

Talks at Conferences and Workshops

  • Choosing a Set of Solutions to Hedge Against the Worst Case.
    6 September 2017, International Conference on Operations Research, Berlin.
  • Approximation of Ellipsoids Using Bounded Uncertainty Sets.
    5 July 2016, European Conference on Operational Research, Poznań.
  • An Introduction to Robust Optimization.
    21 March 2016, Workshop on Stochastic Approaches in Engineering and Financial Mathematics, Hanover.
  • Reliable Shortest Path Problems.
    30 September 2015, Oberseminar TU Dortmund, Dortmund.
  • A Bicriteria Approach to Robust Optimization.
    2 September 2015, International Conference on Operations Research, Wien.
  • Reliable and Quadratic Shortest Path Problems.
    13 July 2015, European Conference on Operational Research, Glasgow.
  • Minmax Regret: Improved Analysis for the Midpoint Solution.
    4 September 2014, International Conference on Operations Research, Aachen.
  • On Comparing Robustness Approaches for Timetabling.
    14 July 2014, Conference of the International Federation of Operational Research Societies, Barcelona.
  • A Column Generation Approach for Workforce Scheduling.
    18 August 2012, Future Research in Combinatorial Optimization, Berlin.