The following pages link to (Q5365144):
Displaying 10 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Relaxations and approximations of chance constraints under finite distributions (Q1650766) (← links)
- <i>K</i>-Adaptability in Two-Stage Robust Binary Programming (Q3465590) (← links)
- Approximation Algorithms for Stochastic and Risk-Averse Optimization (Q4601213) (← links)
- Bicriteria Approximation of Chance-Constrained Covering Problems (Q5131473) (← links)
- Risk-Averse Selfish Routing (Q5219707) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
- (Q5875455) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
