Pages that link to "Item:Q2270290"
From MaRDI portal
The following pages link to Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation (Q2270290):
Displaying 6 items.
- On the approximability of robust spanning tree problems (Q620950) (← links)
- Robust recoverable and two-stage selection problems (Q2410249) (← links)
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights (Q2448903) (← links)
- A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems (Q2488899) (← links)
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
- On greedy approximation algorithms for a class of two-stage stochastic assignment problems (Q5746684) (← links)
