In this paper a class of robust two-stage combinatorial optimization problems is discussed. It
is assumed that the uncertain second-stage costs are specified in the form of a convex …

In robust combinatorial optimization, we would like to find a solution that performs well under
all realizations of an uncertainty set of possible parameter values. How we model this …

In this paper, we consider a robust combinatorial optimization problem with uncertain
weights and propose an uncertainty set that generalizes interval uncertainty by imposing …

We define different concepts of robustness for combinatorial optimization problems and
introduce models for scenario sets in this chapter. From an axiomatic perspective, there is …

Given a nominal combinatorial optimization problem, we consider a robust two-stages
variant with polyhedral cost uncertainty, called DDID. In the first stage, DDID selects a subset …

In this paper, we consider a robust combinatorial optimization problem with uncertain
weights and propose an uncertainty set that generalizes interval uncertainty by imposing …

In this paper, we consider a robust combinatorial optimization problem with uncertain
weights and propose an uncertainty set that generalizes interval uncertainty by imposing …

Gamma uncertainty sets have been introduced for adjusting the degree of conservatism of
robust counterparts of (discrete) linear programs. The contribution of this paper is a …