Robust combinatorial optimization problems under locally budgeted interdiction uncertainty against the objective function and covering constraints

Recently robust combinatorial optimization problems with budgeted interdiction uncertainty affecting cardinality-based constraints or objective were considered by presenting, comparing and experimenting with compact formulations. In this paper we present a compact formulation for the case in which locally budgeted interdiction uncertainty affects the objective function and covering constraints simultaneously.

Article

Download

View PDF