✦ LIBER ✦

Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function

✍ Scribed by Xavier Gandibleux; Frédéric Beugnies; Sabine Randriamasy

Publisher: Springer
Year: 2006
Tongue: English
Weight: 255 KB
Volume: 4
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-005-0074-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A finite-time algorithm for shortest pat

A finite-time algorithm for shortest path problems with time-varying costs

✍ A.B. Philpott; A.I. Mees 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 338 KB

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