Min max (relative) set-regret combinatorial optimization

We consider combinatorial optimization problems with uncertainty in the cost vector. Recently a novel approach was developed to deal such uncertainties: instead of a single one robust solution, obtained by solving a min max problem, the authors consider a set of solutions obtained by solving a min max min problem. In this new approach the … Read more

Approximating the solution for the multiparametric 0-1-mixed integer linear programming problem with interval data

In this paper we present algorithms to approximate the solution for the multiparametric 0-1-mixed integer linear programming problem relative to the objective function. We consider the uncertainty for the parameters that de fine the cost vector corresponding to a subset of 0-1-variables by assuming that each parameter belongs to a known interval. We suppose that we … Read more