Recoverable robust representatives selection problems with discrete budgeted uncertainty
From MaRDI portal
Publication:2158008
DOI10.1016/j.ejor.2022.03.001MaRDI QIDQ2158008
Marc Goerigk, Lasse Wulf, Stefan Lendl
Publication date: 22 July 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.12727
combinatorial optimization; robust optimization; robustness and sensitivity analysis; selection problems; discrete budgeted uncertainty
90Bxx: Operations research and management science
Related Items
A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty, On the complexity of robust multi-stage problems with discrete recourse, Combinatorial optimization problems with balanced regret
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity and in-approximability of a selection problem in robust optimization
- Fuzzy optimization. Recent advances and applications
- Robust discrete optimization and network flows
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- A survey of adjustable robust optimization
- Approximability of the robust representatives selection problem
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Approximating the min-max (regret) selecting items problem
- Solving robust two-stage combinatorial optimization problems under convex uncertainty
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- Recoverable robust spanning tree problem under interval uncertainty representations
- Robust recoverable and two-stage selection problems
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Combinatorial optimization. Theory and applications.
- Recoverable robust shortest path problems
- Introduction to Stochastic Programming
- Recoverable Robust Knapsacks: Γ-Scenarios
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- On the complexity of a class of combinatorial optimization problems with uncertainty
