Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
type: Item
instance of: scholarly article
title: Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
zbMATH Open document ID: 1395.90215
author: Asaf Levin
author: Aleksander Vainer
published in: Journal of Combinatorial Optimization
publication date: 2018-04-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 6859589
zbMATH Keywords: knapsack
zbMATH Keywords: benefit of adaptivity
zbMATH Keywords: stochastic combinatorial optimization
MaRDI profile type: Publication
full work available at URL: s10878-017-0234-x
OpenAlex ID: W2773002526
cites work: A PTAS for the chance-constrained knapsack problem with random item sizes
cites work: Q5365145
cites work: An adaptive stochastic knapsack problem
cites work: Stochastic budget optimization in internet advertising
cites work: The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
cites work: Adaptivity and approximation for stochastic packing problems
cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
cites work: Stochastic Covering and Adaptivity
cites work: Q2934609
cites work: Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
cites work: Q4821303
cites work: Adaptivity in the stochastic blackjack knapsack problem
cites work: Stochastic combinatorial optimization via poisson approximation
cites work: Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract
cites work: Q3993418
cites work: Stochastic models for budget optimization in search-based advertising
cites work: The Dynamic and Stochastic Knapsack Problem with Deadlines
DOI: 10.1007/S10878-017-0234-X
description: scientific article; zbMATH DE number 6859589