𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A dynamic programming solution of a shortest path problem with time constraints on movement and parking

✍ Scribed by N.G.F Sancho

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
310 KB
Volume
166
Category
Article
ISSN
0022-247X

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