Pages that link to "Item:Q1939662"
From MaRDI portal
The following pages link to Two-stage robust network design with exponential scenarios (Q1939662):
Displayed 7 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- On the power of static assignment policies for robust facility location problems (Q2061885) (← links)
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty (Q2515038) (← links)
- <i>K</i>-Adaptability in Two-Stage Robust Binary Programming (Q3465590) (← links)
- Universal Algorithms for Clustering Problems (Q6075750) (← links)
- Two‐stage stochastic minimum <i>s</i> − <i>t</i> cut problems: Formulations, complexity and decomposition algorithms (Q6087397) (← links)