André Chassein

Deutsche Post (Germany) — Germany

Decision Sciences · Social Sciences

11h-index310citations33works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Risk and Portfolio Optimization(24), Multi-Criteria Decision Making(12), Optimization and Mathematical Programming(10), Fuzzy Systems and Optimization(9), Supply Chain and Inventory Management(6)

Publications33 total

On the complexity of min–max–min robustness with two alternatives and budgeted uncertainty
Discrete Applied Mathematics·2020· 9 cited
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
European Journal of Operational Research·2019Open Access
Complexity of strict robust integer minimum cost flow problems: An overview and further results
Computers & Operations Research·2018· 5 cited
On the complexity of robust geometric programming with polyhedral uncertainty
Operations Research Letters·2018· 4 cited
Algorithms and uncertainty sets for data-driven robust shortest path problems
European Journal of Operational Research·2018· 5 citedOpen Access
Approximating multiobjective combinatorial optimization problems with the OWA criterion
arXiv (Cornell University)·2018· 1 citedOpen Access
The quadratic shortest path problem: complexity, approximability, and solution methods
European Journal of Operational Research·2018· 37 citedOpen Access
Faster Algorithms for Min-max-min Robustness for Combinatorial Problems\n with Budgeted Uncertainty
arXiv (Cornell University)·2018Open Access
Min-Max-Min Robustness for Combinatorial Problems with Budgeted Uncertainty
arXiv (Cornell University)·2018· 1 citedOpen Access
Algorithms and Uncertainty Sets for Data-Driven Robust Shortest Path\n Problems
arXiv (Cornell University)·2018Open Access
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
European Journal of Operational Research·2018· 4 cited
On scenario aggregation to approximate robust combinatorial optimization problems
Optimization Letters·2017· 11 cited
On recoverable and two-stage robust selection problems with budgeted uncertainty
European Journal of Operational Research·2017· 28 cited
Variable-sized uncertainty and inverse problems in robust optimization
European Journal of Operational Research·2017· 1 citedOpen Access
On Recoverable and Two-Stage Robust Selection Problems with Budgeted\n Uncertainty
arXiv (Cornell University)·2017Open Access
Having a Plan B for Robust Optimization
Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)·2017· 2 citedOpen Access
On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty
arXiv (Cornell University)·2017Open Access
On Scenario Aggregation to Approximate Robust Optimization Problems
Lancaster EPrints (Lancaster University)·2016· 2 citedOpen Access
On Scenario Aggregation to Approximate Robust Optimization Problems
arXiv (Cornell University)·2016Open Access
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
European Journal of Operational Research·2016· 20 cited
page 1 of 2Next →

Frequent Co-authors

Marc Goerigk(27), Adam Kasperski(4), Paweł Zieliński(4), Jannis Kurtz(3), Michaël Poss(3), Trivikram Dokka(2), Borzou Rostami(1), Michael Hopf(1), Davide Frey(1), Christoph Buchheim(1), Federico Malucelli(1), Kien Trung Nguyen(1), Kien Trung Nguyen(1), Anika Kinscherff(1), Sven O. Krumke(1), Clemens Thielen(1)