We establish strong NP-hardness and in-approximability of the so-called representatives selection problem, a tool selection problem in the area of robust optimization. Our results answer a recent question of Dolgui and Kovalev (4OR Q J Oper Res 10:181–192, 2012). Keywords: Combinatorial optimization; Computational complexity; Robust optimizatio
The robustness function of an optimization problem measures the maximum change in the value of its o...
The robustness function of an optimization problem measures the maximum change in the value of its o...
This paper introduces a new optimization problem, namely the Polynomial Robust Knapsack Problem. It ...
We establish strong NP-hardness and in-approximability of the so-called representatives selection pr...
We establish strong NP-hardness and in-approximability of the so-called representatives selection pr...
We establish strong NP-hardness and in-approximability of the so-called representatives selection pr...
We establish strong NP-hardness and in-approximability of the so-called representatives selection pr...
We extend the standard concept of robust optimization by the introduction of an alternative solution...
AbstractWe identify a class of problems, called controlled selection problems, and study their compl...
While research in robust optimization has attracted considerable interest over the last decades, its...
This is the author accepted manuscript. The final version is available from Elsevier via the DOI in ...
We address the question: "Are some classes of combinatorial optimization problems intrinsically...
The known NP-hardness results imply that for many combinatorial optimization problems there are no e...
We investigate the complexity of the min-max assignment problem under a fixed number of scenarios. W...
Many important problems in computer science, such as CLIQUE, COLORING, and TRAVELLING SALESPERSON, ...
The robustness function of an optimization problem measures the maximum change in the value of its o...
The robustness function of an optimization problem measures the maximum change in the value of its o...
This paper introduces a new optimization problem, namely the Polynomial Robust Knapsack Problem. It ...
We establish strong NP-hardness and in-approximability of the so-called representatives selection pr...
We establish strong NP-hardness and in-approximability of the so-called representatives selection pr...
We establish strong NP-hardness and in-approximability of the so-called representatives selection pr...
We establish strong NP-hardness and in-approximability of the so-called representatives selection pr...
We extend the standard concept of robust optimization by the introduction of an alternative solution...
AbstractWe identify a class of problems, called controlled selection problems, and study their compl...
While research in robust optimization has attracted considerable interest over the last decades, its...
This is the author accepted manuscript. The final version is available from Elsevier via the DOI in ...
We address the question: "Are some classes of combinatorial optimization problems intrinsically...
The known NP-hardness results imply that for many combinatorial optimization problems there are no e...
We investigate the complexity of the min-max assignment problem under a fixed number of scenarios. W...
Many important problems in computer science, such as CLIQUE, COLORING, and TRAVELLING SALESPERSON, ...
The robustness function of an optimization problem measures the maximum change in the value of its o...
The robustness function of an optimization problem measures the maximum change in the value of its o...
This paper introduces a new optimization problem, namely the Polynomial Robust Knapsack Problem. It ...
DOI
Add to ORKG