Approximating the solution of a dynamic, stochastic multiple knapsack problem

MaRDI QIDQ3437241zbMATH OpenFDO

Authors Joseph C. Hartman, Thomas C. Perry

Publication date 14 May 2007

Full work available at URL https://eudml.org/doc/209434

zbMATH Keywords

approximate dynamic programmingdualitylinear programmingstochastic dynamic programming

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Stochastic programming (90C15) Dynamic programming (90C39)

Recommendations

• An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
• The dynamic and stochastic knapsack problem
• The dynamic and stochastic knapsack problem with homogeneous-sized items and postponement options
• An adaptive stochastic knapsack problem
• The Dynamic and Stochastic Knapsack Problem with Deadlines

Cited in

(8)

• Strategic oscillation for the quadratic multiple knapsack problem
• The multi-Handler knapsack problem under uncertainty
• An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
• scientific article; zbMATH DE number 167192 (Why is no real title available?)
• Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
• scientific article; zbMATH DE number 2097195 (Why is no real title available?)
• Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
• A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem

This page was built for publication: Approximating the solution of a dynamic, stochastic multiple knapsack problem

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