The adaptive Knapsack problem with stochastic rewards

DOI10.1287/OPRE.1100.0857MaRDI QIDQ3013933zbMATH OpenOpenAlexFDO

Authors Taylan Ilhan, Mark S. Daskin, Seyed M. R. Iravani

Publication date 19 July 2011

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.1100.0857

zbMATH Keywords

dynamic programmingsequential decision analysis

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Recommendations

• An adaptive stochastic knapsack problem
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• The dynamic and stochastic knapsack problem
• Static stochastic Knapsack problems

Cited in

(10)

• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
• An adaptive stochastic knapsack problem
• Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
• A PTAS for a class of stochastic dynamic programs
• Stochastic knapsack revisited: the service level perspective
• Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
• Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
• Static stochastic Knapsack problems

This page was built for publication: The adaptive Knapsack problem with stochastic rewards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3013933)