An investigation of the recoverable robust assignment problem
D Fischer, TA Hartmann, S Lendl… - arXiv preprint arXiv …, 2020 - arxiv.org
We investigate the so-called recoverable robust assignment problem on balanced bipartite
graphs with $2 n $ vertices, a mainstream problem in robust optimization: For two given …
graphs with $2 n $ vertices, a mainstream problem in robust optimization: For two given …
Recoverable robust optimization with commitment
F Hommelsheim, N Megow, K Muluk, B Peis - arXiv preprint arXiv …, 2023 - arxiv.org
We propose a model for recoverable robust optimization with commitment. Given a
combinatorial optimization problem and uncertainty about elements that may fail, we ask for …
combinatorial optimization problem and uncertainty about elements that may fail, we ask for …
On the recoverable traveling salesman problem
In this paper we consider the Recoverable Traveling Salesman Problem (TSP). Here the
task is to find two tours simultaneously, such that the intersection between the tours is at …
task is to find two tours simultaneously, such that the intersection between the tours is at …
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations
This article deals with the recoverable robust shortest path problem under interval
uncertainty representations. In this problem, a first‐stage path is computed, which can be …
uncertainty representations. In this problem, a first‐stage path is computed, which can be …
Combinatorial optimization problems with balanced regret
M Goerigk, M Hartisch - Discrete Applied Mathematics, 2023 - Elsevier
For decision making under uncertainty, min–max regret has been established as a popular
methodology to find robust solutions. In this approach, we compare the performance of our …
methodology to find robust solutions. In this approach, we compare the performance of our …
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
C Grüne, L Wulf - arXiv preprint arXiv:2411.18590, 2024 - arxiv.org
Recoverable robust optimization is a popular multi-stage approach, in which it is possible to
adjust a first-stage solution after the uncertain cost scenario is revealed. We consider …
adjust a first-stage solution after the uncertain cost scenario is revealed. We consider …
Recoverable robust shortest path problem under interval uncertainty representations
In this paper, the recoverable robust shortest path problem under interval uncertainty
representations is discussed. This problem is known to be strongly NP-hard and also hard to …
representations is discussed. This problem is known to be strongly NP-hard and also hard to …
The robust selection problem with information discovery
We explore a multiple-stage variant of the min-max robust selection problem with budgeted
uncertainty that includes queries. First, one queries a subset of items and gets the exact …
uncertainty that includes queries. First, one queries a subset of items and gets the exact …
Parameterized complexity of submodular minimization under uncertainty
N Kakimura, I Schlotter - arXiv preprint arXiv:2404.07516, 2024 - arxiv.org
This paper studies the computational complexity of a robust variant of a two-stage
submodular minimization problem that we call Robust Submodular Minimizer. In this …
submodular minimization problem that we call Robust Submodular Minimizer. In this …
Min‐sum controllable risk problems with concave risk functions of the same value range
E Gurevsky, D Kopelevich, S Kovalev, MY Kovalyov - Networks, 2022 - Wiley Online Library
A min‐sum controllable risk problem, defined on a given set of elements or on combinatorial
structures, which are either paths of a directed acyclic graph or spanning trees of an …
structures, which are either paths of a directed acyclic graph or spanning trees of an …