Pages that link to "Item:Q290321"
From MaRDI portal
The following pages link to Approximation algorithms for stochastic combinatorial optimization problems (Q290321):
Displaying 20 items.
- Approximation algorithm for stochastic set cover problem (Q2039642) (← links)
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← links)
- Min max min robust (relative) regret combinatorial optimization (Q2216185) (← links)
- The million-variable ``march'' for stochastic combinatorial optimization (Q2494291) (← links)
- Approximation algorithm for the stochastic prize-collecting set multicover problem (Q2670509) (← links)
- On the complexity of nonoverlapping multivariate marginal bounds for probabilistic combinatorial optimization problems (Q2892221) (← links)
- (Q2934726) (← links)
- (Q3340632) (← links)
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (Q3448848) (← links)
- Generalized Dynamic Programming for Stochastic Combinatorial Optimization (Q3468885) (← links)
- On Approximate Solutions for Combinatorial Optimization Problems (Q3477970) (← links)
- Methodology for Stochastic Graph Completion-Time Problems (Q4367048) (← links)
- (Q4418117) (← links)
- (Q4549232) (← links)
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds (Q4652001) (← links)
- Approximation Algorithms for 2-Stage Stochastic Optimization Problems (Q5385968) (← links)
- (Q5501328) (← links)
- Integer Programming and Combinatorial Optimization (Q5712477) (← links)
- (Q5875746) (← links)
- A truthful near-optimal mechanism for online linear packing-covering problem in the random order model (Q6543267) (← links)
