✦ LIBER ✦

A two-phase shortest path algorithm for networks with node coordinates

✍ Scribed by Jens Lysgaard

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 389 KB
Volume: 87
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)00152-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A decomposition algorithm for locating a

A decomposition algorithm for locating a shortest path between two nodes in a network

✍ John J. Jarvis; Suleyman Tufekci 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 505 KB

Decomposition algorithms for finding the

Decomposition algorithms for finding the shortest path between a source node and a sink node of a network

✍ Suleyman Tufekci 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

An algorithm for determining the shortes

An algorithm for determining the shortest path on a network graph

✍ S.M. Alekseeva; O.G. Alekseev 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 568 KB

A generalized permanent label setting al

A generalized permanent label setting algorithm for the shortest path between specified nodes

✍ George L Nemhauser 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 292 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

A General Algorithm for Finding a Shorte

A General Algorithm for Finding a Shortest Path between two n-Configurations

✍ M.C. Er 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 254 KB