| Publication | Date of Publication | Type |
|---|
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
Discrete Applied Mathematics | 2021-04-20 | Paper |
Approximating combinatorial optimization problems with the ordered weighted averaging criterion
European Journal of Operational Research | 2020-06-17 | Paper |
On the complexity of robust geometric programming with polyhedral uncertainty
Operations Research Letters | 2020-02-10 | Paper |
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
European Journal of Operational Research | 2019-07-05 | Paper |
Complexity of strict robust integer minimum cost flow problems: an overview and further results
Computers & Operations Research | 2019-02-14 | Paper |
Algorithms and uncertainty sets for data-driven robust shortest path problems
European Journal of Operational Research | 2018-12-18 | Paper |
Algorithms and uncertainty sets for data-driven robust shortest path problems
European Journal of Operational Research | 2018-12-18 | Paper |
On scenario aggregation to approximate robust combinatorial optimization problems
Optimization Letters | 2018-10-23 | Paper |
On scenario aggregation to approximate robust combinatorial optimization problems
Optimization Letters | 2018-10-23 | Paper |
The quadratic shortest path problem: complexity, approximability, and solution methods
European Journal of Operational Research | 2018-05-30 | Paper |
Capacitated network design games with weighted players
Networks | 2018-05-23 | Paper |
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
European Journal of Operational Research | 2018-05-22 | Paper |
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
European Journal of Operational Research | 2018-05-22 | Paper |
| scientific article; zbMATH DE number 6843801 (Why is no real title available?) | 2018-02-27 | Paper |
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
European Journal of Operational Research | 2018-02-16 | Paper |
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
European Journal of Operational Research | 2018-02-16 | Paper |
Variable-sized uncertainty and inverse problems in robust optimization
European Journal of Operational Research | 2018-02-01 | Paper |
Variable-sized uncertainty and inverse problems in robust optimization
European Journal of Operational Research | 2018-02-01 | Paper |
On recoverable and two-stage robust selection problems with budgeted uncertainty
European Journal of Operational Research | 2017-11-23 | Paper |
On recoverable and two-stage robust selection problems with budgeted uncertainty
European Journal of Operational Research | 2017-11-23 | Paper |
A bicriteria approach to robust optimization
Computers & Operations Research | 2016-11-17 | Paper |
On the recoverable robust traveling salesman problem
Optimization Letters | 2016-10-27 | Paper |
The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
European Journal of Operational Research | 2016-10-06 | Paper |
A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
European Journal of Operational Research | 2016-10-06 | Paper |
Inverse eccentric vertex problem on networks
CEJOR. Central European Journal of Operations Research | 2016-07-04 | Paper |
Alternative formulations for the ordered weighted averaging objective
Information Processing Letters | 2015-05-21 | Paper |
