Some remarks about the Kasperski and Zielinski approximation algorithm for a class of
interval data minmax regret combinatorial optimization problems (Algorithm K&Z) are …

In this note, a 2-approximation method for minmax regret optimization problems is
developed which extends the work of Kasperski and Zielinski [A. Kasperski, P. Zielinski, An …

The general problem of minimizing the maximal regret in combinatorial optimization
problems with interval data is considered. In many cases, the minmax regret versions of the …

The general problem of minimizing the maximal regret in combinatorial optimization
problems with interval costs is considered. Some results are proven that allow to obtain a …

Uncertainty in optimization is not a new ingredient. Diverse models considering uncertainty
have been developed over the last 40 years. In our paper we essentially discuss a particular …

This work deals with a class of problems under interval data uncertainty, namely interval
robust-hard problems, composed of interval data min-max regret generalizations of classical …

In this paper, we provide a generic anytime lower bounding procedure for minmax regret
optimization problems. We show that the lower bound obtained is always at least as …

In this paper, we provide polynomial and pseudopolynomial algorithms for classes of
particular instances of interval data minmax regret graph problems. These classes are …

For minmax regret versions of some basic resource allocation problems with linear cost
functions and uncertain coefficients (interval-data case), we present efficient (polynomial …

Contents We start this chapter by recalling the formulation of a deterministic combinatorial
optimization problem, that is the one in which all the input parameters are precisely known …