An adaptive stochastic knapsack problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A Renewal Decision Problem
- Finite Horizon Stochastic Knapsacks with Applications to Yield Management
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Note—On “A Renewal Decision Problem”
- On two-stage stochastic knapsack problems
- Optimal project selection: Stochastic knapsack with finite time horizon
- Random knapsacks with many constraints
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
- The adaptive Knapsack problem with stochastic rewards
- The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem
- The dynamic and stochastic knapsack problem
- The static stochastic knapsack problem with normally distributed item sizes
- The stochastic knapsack problem
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
Cited in
(15)- The stochastic knapsack problem
- A stochastic linear knapsack problem
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
- Turnpikes in Finite Markov Decision Processes and Random Walk
- Approximating the solution of a dynamic, stochastic multiple knapsack problem
- Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem
- Improved approximation results for stochastic knapsack problems
- A PTAS for a class of stochastic dynamic programs
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
- scientific article; zbMATH DE number 5685026 (Why is no real title available?)
- The adaptive Knapsack problem with stochastic rewards
- High generalization performance structured self-attention model for knapsack problem
- The Risk-Averse Static Stochastic Knapsack Problem
- Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
- Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
This page was built for publication: An adaptive stochastic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297367)