Pages that link to "Item:Q5449799"
From MaRDI portal
The following pages link to Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems (Q5449799):
Displaying 8 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- An \(s\)-\(t\) connection problem with adaptability (Q534328) (← links)
- On the approximability of robust spanning tree problems (Q620950) (← links)
- Two-stage robust network design with exponential scenarios (Q1939662) (← links)
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty (Q2515038) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- Two‐stage stochastic minimum <i>s</i> − <i>t</i> cut problems: Formulations, complexity and decomposition algorithms (Q6087397) (← links)
