André B. Chassein

Publication Activity (10 Years)

Years Active: 2015-2021
Publications (10 Years): 18

Top Topics

Traveling Salesman Problem

Shortest Path Problem

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Publications

André B. Chassein, Marc Goerigk
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. Discret. Appl. Math. 296 (2021)
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
Approximating combinatorial optimization problems with the ordered weighted averaging criterion. Eur. J. Oper. Res. 286 (3) (2020)
André B. Chassein, Anika Kinscherff
Complexity of strict robust integer minimum cost flow problems: An overview and further results. Comput. Oper. Res. 104 (2019)
André B. Chassein, Trivikram Dokka, Marc Goerigk
Algorithms and uncertainty sets for data-driven robust shortest path problems. Eur. J. Oper. Res. 274 (2) (2019)
André B. Chassein, Marc Goerigk, Jannis Kurtz, Michael Poss
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty. Eur. J. Oper. Res. 279 (2) (2019)
André B. Chassein, Marc Goerigk
On the complexity of robust geometric programming with polyhedral uncertainty. Oper. Res. Lett. 47 (1) (2019)
André B. Chassein, Marc Goerigk
On scenario aggregation to approximate robust combinatorial optimization problems. Optim. Lett. 12 (7) (2018)
André B. Chassein, Marc Goerigk
Variable-sized uncertainty and inverse problems in robust optimization. Eur. J. Oper. Res. 264 (1) (2018)
André B. Chassein, Marc Goerigk
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty. Eur. J. Oper. Res. 269 (2) (2018)
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
Approximating multiobjective combinatorial optimization problems with the OWA criterion. CoRR (2018)
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
On recoverable and two-stage robust selection problems with budgeted uncertainty. Eur. J. Oper. Res. 265 (2) (2018)
Borzou Rostami, André B. Chassein, Michael Hopf, Davide Frey, Christoph Buchheim, Federico Malucelli, Marc Goerigk
The quadratic shortest path problem: complexity, approximability, and solution methods. Eur. J. Oper. Res. 268 (2) (2018)
André B. Chassein, Marc Goerigk
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets. Eur. J. Oper. Res. 258 (1) (2017)
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty. CoRR (2017)
André B. Chassein, Marc Goerigk
On the recoverable robust traveling salesman problem. Optim. Lett. 10 (7) (2016)
André B. Chassein, Sven O. Krumke, Clemens Thielen
Capacitated network design games with weighted players. Networks 68 (2) (2016)
Marc Goerigk, André B. Chassein
On Scenario Aggregation to Approximate Robust Optimization Problems. CoRR (2016)
André B. Chassein, Marc Goerigk
A bicriteria approach to robust optimization. Comput. Oper. Res. 66 (2016)
André B. Chassein, Marc Goerigk
Alternative formulations for the ordered weighted averaging objective. Inf. Process. Lett. 115 (6-8) (2015)
Kien Trung Nguyen, André B. Chassein
The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance. Eur. J. Oper. Res. 247 (3) (2015)
Kien Trung Nguyen, André B. Chassein
Inverse eccentric vertex problem on networks. Central Eur. J. Oper. Res. 23 (3) (2015)
André B. Chassein, Marc Goerigk
A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem. Eur. J. Oper. Res. 244 (3) (2015)