Improved approximation results for stochastic knapsack problems
From MaRDI portal
Recommendations
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
- Stochastic combinatorial optimization via Poisson approximation
- Adaptivity and approximation for stochastic packing problems
- An adaptive stochastic knapsack problem
Cited in
(47)- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
- Knapsack with variable weights satisfying linear constraints
- Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
- A fully polynomial-time approximation scheme for approximating a sum of random variables
- Exact algorithms for the 0-1 time-bomb knapsack problem
- Non-adaptive stochastic score classification and explainable halfspace evaluation
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
- The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
- Approximation algorithms for stochastic combinatorial optimization problems
- Robust optimization approach for a chance-constrained binary knapsack problem
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- scientific article; zbMATH DE number 4061000 (Why is no real title available?)
- Adaptivity in the stochastic blackjack knapsack problem
- scientific article; zbMATH DE number 167192 (Why is no real title available?)
- Boolean function analysis meets stochastic optimization: an approximation scheme for stochastic knapsack
- Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
- scientific article; zbMATH DE number 1408349 (Why is no real title available?)
- Stochastic unsplittable flows
- A PTAS for a class of stochastic dynamic programs
- scientific article; zbMATH DE number 7626775 (Why is no real title available?)
- Stochastic knapsack revisited: the service level perspective
- A relaxed FPTAS for chance-constrained knapsack
- Stochastic graph exploration
- Computing Optimized Path Integrals for Knapsack Feasibility
- Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
- Approximation algorithms for stochastic k-TSP
- Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
- Maximizing expected utility for stochastic combinatorial optimization problems
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- Packing a knapsack of unknown capacity
- scientific article; zbMATH DE number 5685026 (Why is no real title available?)
- Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: extended abstract
- Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model
- Stochastic combinatorial optimization via Poisson approximation
- scientific article; zbMATH DE number 7053373 (Why is no real title available?)
- Adaptive Bin Packing with Overflow
- scientific article; zbMATH DE number 7650116 (Why is no real title available?)
- Configuration balancing for stochastic requests
- Stochastic graph exploration with limited resources
- Stochastic Probing with Increasing Precision
- Correlated stochastic knapsack with a submodular objective
- Online contention resolution schemes for size-stochastic knapsacks
- Configuration balancing for stochastic requests
- On the adaptivity gap of stochastic orienteering
This page was built for publication: Improved approximation results for stochastic knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365145)
