Advancements in mathematical programming have made it possible to effici...
In this paper, an optimization problem with uncertain objective function...
We study the computational complexity of multi-stage robust optimization...
With dramatic improvements in optimization software, the solution of
lar...
In this work we study robust one- and two-stage problems with discrete
u...
This paper presents a mixed-integer linear programming formulation for t...
Robust discrete optimization is a highly active field of research where ...
For decision making under uncertainty, min-max regret has been establish...
In this paper we consider the Recoverable Traveling Salesman Problem (TS...
We investigate the recoverable robust single machine scheduling problem ...
We consider two-stage robust optimization problems, which can be seen as...
Robust optimization has been established as a leading methodology to app...
This paper considers a recoverable robust single-machine scheduling prob...
Recoverable robust optimization is a multi-stage approach, where it is
p...
In this paper a class of combinatorial optimization problems is discusse...
We develop algorithms capable of tackling robust black-box optimisation
...
We study the multi-level bottleneck assignment problem (MBA), which has
...
In this paper a class of robust two-stage combinatorial optimization pro...
In this paper a class of combinatorial optimization problems is discusse...
In robust optimization, the uncertainty set is used to model all possibl...
While research in robust optimization has attracted considerable interes...
The paper deals with a multiobjective combinatorial optimization problem...