𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Thomas C. Perry; Joseph C. Hartman

Book ID
111205948
Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
210 KB
Volume
16
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dynamic programming approaches to the mu
Dynamic programming approaches to the multiple criteria knapsack problem
✍ Kathrin Klamroth; Margaret M. Wiecek πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 251 KB πŸ‘ 2 views

We study the integer multiple criteria knapsack problem and propose dynamicprogramming-based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and mul

A simulation-based approach to stochasti
A simulation-based approach to stochastic dynamic programming
✍ Nicholas G. Polson; Morten Sorensen πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 492 KB πŸ‘ 2 views

## Abstract In this paper we develop a simulation‐based approach to stochastic dynamic programming. To solve the Bellman equation we construct Monte Carlo estimates of __Q__‐values. Our method is scalable to high dimensions and works in both continuous and discrete state and decision spaces while a