In this survey, we discuss the state of the art of robust combinatorial optimization under
uncertain cost functions. We summarize complexity results presented in the literature for …

We examine the robust counterpart of the classical capacitated vehicle routing problem
(CVRP). We consider two types of uncertainty sets for the customer demands: the classical …

We consider the generalized assignment problem (GAP) with min-max regret criterion under
interval costs. This problem models many real-world applications in which jobs must be …

We consider robust single machine scheduling problems. First, we prove that with uncertain
processing times, minimizing the number of tardy jobs is NP-hard. Second, we show that the …

We consider a robust optimization problem with continuous decision-dependent uncertainty
(RO-CDDU), which has two significant features: an uncertainty set linearly dependent on …

We consider robust combinatorial optimization problems where the decision maker can
react to a scenario by choosing from a finite set of k solutions. This approach is appropriate …

Abstract The Resource Constrained Shortest Path Problem (RCSPP) models several
applications in the fields of transportation and communications. The classical problem …

We consider robust combinatorial optimization problems with cost uncertainty where the
decision maker can prepare K solutions beforehand and chooses the best of them once the …

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 …

The research field of optimization under uncertainty, even though already established in the
middle of the last century, gained much attention in the last two decades. The necessity to …