Pages that link to "Item:Q5495869"
From MaRDI portal
The following pages link to Stochastic combinatorial optimization via poisson approximation (Q5495869):
Displaying 14 items.
- Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem (Q1743485) (← links)
- A fully polynomial-time approximation scheme for approximating a sum of random variables (Q1785211) (← links)
- The million-variable ``march'' for stochastic combinatorial optimization (Q2494291) (← links)
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (Q3448848) (← links)
- Auction Design with a Revenue Target (Q3449588) (← links)
- Stochastic Load Balancing on Unrelated Machines (Q4991668) (← links)
- Stochastic Unsplittable Flows (Q5002608) (← links)
- (Q5002731) (← links)
- (Q5091069) (← links)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
- (Q5875506) (← links)