Pages that link to "Item:Q959814"
From MaRDI portal
The following pages link to Commitment under uncertainty: Two-stage stochastic matching problems (Q959814):
Displaying 11 items.
- On the approximability of robust spanning tree problems (Q620950) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- Online spatio-temporal matching in stochastic and dynamic domains (Q1648078) (← links)
- On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion (Q2189877) (← links)
- Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
- Two-stage combinatorial optimization problems under risk (Q2283029) (← links)
- Robust recoverable and two-stage selection problems (Q2410249) (← links)
- Risk Averse Scheduling with Scenarios (Q4685788) (← links)
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints (Q6202946) (← links)
