Two-stage robust optimization problems with two-stage uncertainty
From MaRDI portal
Publication:2140314
DOI10.1016/j.ejor.2021.12.046MaRDI QIDQ2140314
Marc Goerigk, Stefan Lendl, Lasse Wulf
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.03043
combinatorial optimization; robust optimization; budgeted uncertainty; robustness and sensitivity analysis; multistage optimization
Related Items
A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty, Robust combinatorial optimization with locally budgeted uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The robust knapsack problem with queries
- Robust load planning of trains in intermodal transportation
- Robust discrete optimization and network flows
- Adjustable robust solutions of uncertain linear programs
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Combinatorial optimization with interaction costs: complexity and solvable cases
- An adversarial model for scheduling with testing
- A robust optimization approach with probe-able uncertainty
- Two-stage combinatorial optimization problems under risk
- A robust optimization approach to wine grape harvesting scheduling
- Robust recoverable and two-stage selection problems
- Query-competitive sorting with uncertainty
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
- Multistage robust discrete optimization via quantified integer programming
- Multistage Robust Mixed-Integer Optimization with Adaptive Partitions
- Computing the median with uncertainty
- A Robust Optimization Approach to Inventory Theory
- Computing shortest paths with uncertainty
- Ottimizzazione Combinatoria
- The Price of Robustness
- Robust Two-Stage Network Problems
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
