[HTML][HTML] Investigating the recoverable robust single machine scheduling problem under interval uncertainty
We investigate the recoverable robust single machine scheduling problem under interval
uncertainty. In this setting, jobs have first-stage processing times p and second-stage …
uncertainty. In this setting, jobs have first-stage processing times p and second-stage …
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 …
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 …
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 …
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 …
Recoverable Possibilistic Linear Programming
A Kasperski, P Zieliński - 2024 IEEE International Conference …, 2024 - ieeexplore.ieee.org
In this paper, a recoverable version of a linear programming problem under a possibilistic
model of uncertainty is considered. It is assumed that a feasible first-stage solution can be …
model of uncertainty is considered. It is assumed that a feasible first-stage solution can be …
Other Combinatorial Problems
M Goerigk, M Hartisch - … Optimization: Concepts, Models and Algorithms for …, 2024 - Springer
Other Combinatorial Problems | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
[图书][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 …