Pages that link to "Item:Q5384047"
From MaRDI portal
The following pages link to Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract (Q5384047):
Displaying 13 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- On the adaptivity gap of stochastic orienteering (Q896283) (← links)
- Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem (Q1743485) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts (Q2285050) (← links)
- Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835) (← links)
- Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
- Stochastic Unsplittable Flows (Q5002608) (← links)
- Stochastic graph exploration (Q5092339) (← links)
- (Q5136319) (← links)
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← links)
- (Q5875506) (← links)
