Pages that link to "Item:Q2488899"
From MaRDI portal
The following pages link to A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems (Q2488899):
Displayed 11 items.
- Sell or hold: A simple two-stage stochastic combinatorial optimization problem (Q435735) (← links)
- The discrete sell or hold problem with constraints on asset values (Q496023) (← links)
- Commitment under uncertainty: Two-stage stochastic matching problems (Q959814) (← links)
- Totally unimodular stochastic programs (Q1949257) (← links)
- The submodularity of two-stage stochastic maximum-weight independent set problems (Q2089673) (← links)
- Two-stage stochastic max-weight independent set problems (Q2149870) (← 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)
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
- Two‐stage stochastic minimum <i>s</i> − <i>t</i> cut problems: Formulations, complexity and decomposition algorithms (Q6087397) (← links)