An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem

DOI10.1111/j.1475-3995.2008.00679.xzbMath1176.90622OpenAlexW2083844949MaRDI QIDQ3184585

Joseph C. Hartman, Thomas C. Perry

Publication date: 21 October 2009

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2008.00679.x

zbMATH Keywords

simulationstochastic dynamic programmingapproximate dynamic programming

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items

Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization

Cites Work

• The Dynamic and Stochastic Knapsack Problem
• Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
• An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
• Conditions for the Existence of Planning Horizons
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems
• The stochastic knapsack problem
• Monotonicity properties for the stochastic knapsack
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• Finite Horizon Stochastic Knapsacks with Applications to Yield Management
• Solving a dynamic resource allocation problem through continuous optimization
• A Distributed Decision-Making Structure for Dynamic Resource Allocation Using Nonlinear Functional Approximations
• Unnamed Item