The following pages link to (Q5501328):
Displayed 19 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- Permutation betting markets: singleton betting with extra information (Q547299) (← links)
- Commitment under uncertainty: Two-stage stochastic matching problems (Q959814) (← links)
- Improved bounds in stochastic matching and optimization (Q1755741) (← links)
- A priori TSP in the scenario model (Q1801079) (← links)
- Two-stage robust network design with exponential scenarios (Q1939662) (← links)
- On the power of static assignment policies for robust facility location problems (Q2061885) (← links)
- Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation (Q2270290) (← links)
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights (Q2448903) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty (Q2515038) (← links)
- A priori TSP in the Scenario Model (Q2971168) (← links)
- Probabilistic models for the Steiner Tree problem (Q3057166) (← links)
- <i>K</i>-Adaptability in Two-Stage Robust Binary Programming (Q3465590) (← links)
- Approximation Algorithms for Stochastic and Risk-Averse Optimization (Q4601213) (← links)
- Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models (Q5219734) (← links)
- (Q5875455) (← links)