𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shortest path problems with partial information: Models and algorithms for detecting dominance

✍ Scribed by Luis C. Dias; João N. Clı́maco

Book ID
108445510
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
191 KB
Volume
121
Category
Article
ISSN
0377-2217

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