André B. Chassein

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