Pages that link to "Item:Q5219671"
From MaRDI portal
The following pages link to Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671):
Displaying 6 items.
- An adversarial model for scheduling with testing (Q2211361) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories (Q2935312) (← links)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
- Stochastic Probing with Increasing Precision (Q6187078) (← links)