On the complexity of robust multi-stage problems with discrete recourse
We study the computational complexity of multi-stage robust optimization problems. Such
problems are formulated with alternating min/max quantifiers and therefore naturally fall into …
problems are formulated with alternating min/max quantifiers and therefore naturally fall into …
Two-stage robust optimization problems with two-stage uncertainty
We consider two-stage robust optimization problems, which can be seen as games between
a decision maker and an adversary. After the decision maker fixes part of the solution, the …
a decision maker and an adversary. After the decision maker fixes part of the solution, the …
On the complexity of robust multi-stage problems in the polynomial hierarchy
We study the computational complexity of multi-stage robust optimization problems. Such
problems are formulated with alternating min/max quantifiers and therefore naturally fall into …
problems are formulated with alternating min/max quantifiers and therefore naturally fall into …
Robust combinatorial optimization with locally budgeted uncertainty
Budgeted uncertainty sets have been established as a major influence on uncertainty
modeling for robust optimization problems. A drawback of such sets is that the budget …
modeling for robust optimization problems. A drawback of such sets is that the budget …
A single representative min–max–min robust selection problem with alternatives and budgeted uncertainty
A robust two-stage problem of selecting a single minimum cost representative out of n
candidates is studied. Each candidate is associated with an uncertain cost that is described …
candidates is studied. Each candidate is associated with an uncertain cost that is described …
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 …
[PDF][PDF] Two-stage robust combinatorial optimization problems with consistent decisions under discrete demand uncertainty and an application to appointment …
S Schmitz - 2024 - publications.rwth-aachen.de
In primary health care systems, primary care physicians (PCP) play a pivotal role as they are
the initial point of contact for patients seeking medical care and they also coordinate …
the initial point of contact for patients seeking medical care and they also coordinate …
Robust Selection Problems
M Goerigk, M Hartisch - … Optimization: Concepts, Models and Algorithms for …, 2024 - Springer
Focussing on selection problems, we discuss the problem complexity and approximability
for various combinations of decision criterion and uncertainty set. In particular, we show that …
for various combinations of decision criterion and uncertainty set. In particular, we show that …
[图书][B] Algorithmic Developments in Two-Stage Robust Scheduling
M Bold - 2022 - search.proquest.com
Algorithmic Developments in Two-Stage Robust Scheduling Page 1 Algorithmic Developments
in Two-Stage Robust Scheduling Matthew Bold, B.Sc.(Hons.), M.Res Submitted for the degree …
in Two-Stage Robust Scheduling Matthew Bold, B.Sc.(Hons.), M.Res Submitted for the degree …