Pages that link to "Item:Q2023665"
From MaRDI portal
The following pages link to Oracle-based algorithms for binary two-stage robust optimization (Q2023665):
Displaying 9 items.
- A Lagrangian dual method for two-stage robust optimization with binary uncertainties (Q2101650) (← links)
- Solving two-stage robust optimization problems using a column-and-constraint generation method (Q2450689) (← links)
- (Q4967176) (← links)
- Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems (Q5085995) (← links)
- Adjustable robust optimization with objective uncertainty (Q6069242) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
- An oracle-based framework for robust combinatorial optimization (Q6183084) (← links)
- Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty (Q6561382) (← links)
- Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty (Q6633275) (← links)
