TECHNICAL NOTE—The Adaptive Knapsack Problem with Stochastic Rewards

DOI10.1287/opre.1100.0857zbMath1218.90174OpenAlexW2146390427MaRDI QIDQ3013933

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)

Related Items (10)

An adaptive stochastic knapsack problem ⋮ A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs ⋮ Stochastic Knapsack Revisited: The Service Level Perspective ⋮ STATIC STOCHASTIC KNAPSACK PROBLEMS ⋮ Unnamed Item ⋮ Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards ⋮ 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 ⋮ Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms ⋮ Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes

This page was built for publication: TECHNICAL NOTE—The Adaptive Knapsack Problem with Stochastic Rewards