Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
From MaRDI portal
Publication:2817835
Recommendations
- 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
- The static stochastic knapsack problem with normally distributed item sizes
- The Dynamic and Stochastic Knapsack Problem with Deadlines
- Improved approximation results for stochastic knapsack problems
Cites work
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1559582 (Why is no real title available?)
- scientific article; zbMATH DE number 2171466 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- A PTAS for the chance-constrained knapsack problem with random item sizes
- A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
- A Price-Directed Approach to Stochastic Inventory/Routing
- A Renewal Decision Problem
- A dynamic traveling salesman problem with stochastic arc costs
- A note on the extension complexity of the knapsack polytope
- Adaptivity and approximation for stochastic packing problems
- Algorithms for stochastic mixed-integer programming models
- Allocating Bandwidth for Bursty Connections
- An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
- Approximate formulations for 0-1 knapsack sets
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Generalized polynomial approximations in Markovian decision processes
- Improved approximation results for stochastic knapsack problems
- Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: extended abstract
- Information relaxations and duality in stochastic dynamic programs
- Preference Order Stochastic Knapsack Problems: Methodological Issues
- SPLINE APPROXIMATIONS TO VALUE FUNCTIONS
- Stochastic linear knapsack programming problem and its application to a portfolio selection problem
- The Dynamic and Stochastic Knapsack Problem with Deadlines
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- The Linear Programming Approach to Approximate Dynamic Programming
- The Theory and Computation of Knapsack Functions
- The adaptive Knapsack problem with stochastic rewards
- The dynamic and stochastic knapsack problem
- The static stochastic knapsack problem with normally distributed item sizes
Cited in
(12)- Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories
- scientific article; zbMATH DE number 7561426 (Why is no real title available?)
- Dynamic node packing
- Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
- Network-based approximate linear programming for discrete optimization
- Approximations to stochastic dynamic programs via information relaxation duality
- Adaptive Bin Packing with Overflow
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
- Stochastic knapsack revisited: the service level perspective
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
This page was built for publication: Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817835)
