A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty

Robust combinatorial optimization problems with cardinality constrained uncertainty may be solved by a finite number of nominal problems. In this paper, we show that the number of nominal problems to be solved can be reduced significantly.