Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract
From MaRDI portal
Publication:5384047
DOI10.1137/1.9781611973402.85zbMath1422.68307OpenAlexW2394800294MaRDI QIDQ5384047
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973402.85
Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Probabilistic games; gambling (91A60)
Related Items (14)
Approximation algorithms for stochastic combinatorial optimization problems ⋮ On the adaptivity gap of stochastic orienteering ⋮ Unnamed Item ⋮ Stochastic graph exploration with limited resources ⋮ Stochastic Unsplittable Flows ⋮ Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem ⋮ Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes ⋮ A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes ⋮ Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts ⋮ Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms ⋮ Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes ⋮ Stochastic graph exploration ⋮ Submodular Maximization with Uncertain Knapsack Capacity ⋮ Unnamed Item
This page was built for publication: Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract
