Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty

Buchheim, C; Kurtz, J

Kurtz, J (reprint author), Tech Univ Dortmund, Fak Math, Vogelpothsweg 87, D-44227 Dortmund, Germany.

DISCRETE OPTIMIZATION, 2018; 28 (): 1

Abstract

We consider combinatorial optimization problems with uncertain linear objective functions. In the min-max-min robust optimization approach, a fixed nu......

Full Text Link