✦ LIBER ✦

Dynamic programming for stochastic target problems and geometric flows

✍ Scribed by H. Mete Soner; Nizar Touzi

Publisher: European Mathematical Society
Year: 2002
Tongue: English
Weight: 294 KB
Volume: 4
Category: Article
ISSN: 1435-9855
DOI: 10.1007/s100970100039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the expected value of stochastic line

On the expected value of stochastic linear programs and (dynamic) network flow problems

✍ Ulrich Fincke; Horst W. Hamacher 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 632 KB

Decomposition of mathematical programmin

Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programs

✍ Hisashi Mine; Katsuhisa Ohno 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Fuzzy stochastic dynamic programming for

Fuzzy stochastic dynamic programming for marketing decision support

✍ Klaus Weber; Zhaohao Sun 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 431 KB

An adaptive dynamic programming algorith

An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem

✍ Katerina P. Papadaki; Warren B. Powell 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

Distributed dynamic programming for disc

Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms

✍ William M. McEneaney 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 571 KB

Iterative methods for dynamic stochastic

Iterative methods for dynamic stochastic shortest path problems

✍ Raymond K. Cheung 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

We consider a routing policy that forms a dynamic shortest path in a network with independent, positive and discrete random arc costs. When visiting a node in the network, the costs for the arcs going out of this node are realized, and then the policy will determine which node to visit next with the