Inverse eccentric vertex problem on networks. - Kien Trung Nguyen; André B. Chassein (Central Eur. J. Oper. Res., 2015)

A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem. - André B. Chassein; Marc Goerigk (Eur. J. Oper. Res., 2015)

The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance. - Kien Trung Nguyen; André B. Chassein (Eur. J. Oper. Res., 2015)

Alternative formulations for the ordered weighted averaging objective. - André B. Chassein; Marc Goerigk (Inf. Process. Lett., 2015)

A bicriteria approach to robust optimization. - André B. Chassein; Marc Goerigk (Comput. Oper. Res., 2016)

On Scenario Aggregation to Approximate Robust Optimization Problems. - Marc Goerigk; André B. Chassein (CoRR, 2016)

Capacitated network design games with weighted players. - André B. Chassein; Sven O. Krumke; Clemens Thielen (Networks, 2016)

On the recoverable robust traveling salesman problem. - André B. Chassein; Marc Goerigk (Optim. Lett., 2016)

Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets. - André B. Chassein; Marc Goerigk (Eur. J. Oper. Res., 2017)

Approximating multiobjective combinatorial optimization problems with the OWA criterion. - André B. Chassein; Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (CoRR, 2018)

Variable-sized uncertainty and inverse problems in robust optimization. - André B. Chassein; Marc Goerigk (Eur. J. Oper. Res., 2018)

Compromise solutions for robust combinatorial optimization with variable-sized uncertainty. - André B. Chassein; Marc Goerigk (Eur. J. Oper. Res., 2018)

On recoverable and two-stage robust selection problems with budgeted uncertainty. - André B. Chassein; Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (Eur. J. Oper. Res., 2018)

The quadratic shortest path problem: complexity, approximability, and solution methods. - Borzou Rostami; André B. Chassein; Michael Hopf; Davide Frey; Christoph Buchheim; Federico Malucelli; Marc Goerigk (Eur. J. Oper. Res., 2018)

On scenario aggregation to approximate robust combinatorial optimization problems. - André B. Chassein; Marc Goerigk (Optim. Lett., 2018)

Complexity of strict robust integer minimum cost flow problems: An overview and further results. - André B. Chassein; Anika Kinscherff (Comput. Oper. Res., 2019)

Algorithms and uncertainty sets for data-driven robust shortest path problems. - André B. Chassein; Trivikram Dokka; Marc Goerigk (Eur. J. Oper. Res., 2019)

Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty. - André B. Chassein; Marc Goerigk; Jannis Kurtz; Michael Poss (Eur. J. Oper. Res., 2019)

On the complexity of robust geometric programming with polyhedral uncertainty. - André B. Chassein; Marc Goerigk (Oper. Res. Lett., 2019)

Approximating combinatorial optimization problems with the ordered weighted averaging criterion. - André B. Chassein; Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (Eur. J. Oper. Res., 2020)

On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. - André B. Chassein; Marc Goerigk (Discret. Appl. Math., 2021)