𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A special case of the dynamization problem for least cost paths

✍ Scribed by Davide Crippa

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
764 KB
Volume
39
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A special case of the 3 Γ— n flow shop pr
A special case of the 3 Γ— n flow shop problem
✍ Fennell Burns; John Rooker πŸ“‚ Article πŸ“… 1975 πŸ› John Wiley and Sons 🌐 English βš– 275 KB

## Abstract Johnson [2] in 1954 solved the two machine flow shop problem by giving an argument for a sufficient condition of optimality and by stating an efficient algorithm which produces a solution via satisfaction of the sufficient condition. Moreover, Johnson solved two special cases of the cor