On a Class of Interval Data Minmax Regret CO Problems

Some remarks about the Kasperski and Zielinski approximation algorithm for a class of interval data minmax regret combinatorial optimization problems (Algorithm K&Z) are presented. These remarks help to give a better understanding of both the design of the algorithm and its possible applications.