𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An optimal sublinear time parallel algorithm for some dynamic programming problems

✍ Scribed by Lawrence L. Larmore; Wojciech Rytter

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
366 KB
Volume
52
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An inverse dynamics-based dynamic progra
An inverse dynamics-based dynamic programming method for optimal control problems of linear systems
✍ Chen-Wen V. Yen; Tsong-Zen Liu πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 83 KB πŸ‘ 1 views

In solving optimal control problems, the conventional dynamic programming method often requires interpolations to determine the optimal control law. As a consequence, interpolation errors often degenerate the accuracy of the conventional dynamic programming method. In view of this problem, this pape

A dynamic programming algorithm for the
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
✍ Ioachim, Irina; GοΏ½linas, Sylvie; Soumis, FranοΏ½ois; Desrosiers, Jacques πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w