In this chapter a review of recent results on robust discrete optimization is presented. The
most popular discrete and interval uncertainty representations are discussed. Various robust …

This paper reviews problems, approaches, models and algorithms on robust assembly line
balancing problems and discuss some promising research directions. The scope covers …

This paper addresses the balancing problem for straight assembly lines where task times
are not known exactly but given by intervals of their possible values. The objective is to …

The multiple-choice multidimensional knapsack problem (MMKP) assumes n sets composed
of mutually exclusive items. The goal is to select exactly one item per set, maximizing the …

Recoverable robust optimization is a multi-stage approach, in which it is possible to adjust a
first-stage solution after the uncertain cost scenario is revealed. We analyze this approach …

In this paper, we study a robust two-stage concept for combinatorial optimization problems
under discrete demand uncertainty. Combinatorial optimization problems are based on a …

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 a class of combinatorial optimization problems is discussed. It is assumed that
a solution can be constructed in two stages. The current first-stage costs are precisely …

Robust discrete optimization is a highly active field of research where a plenitude of
combinations between decision criteria, uncertainty sets and underlying nominal problems …