✦ LIBER ✦

On the online shortest path problem with limited arc cost dependencies

✍ Scribed by S. Travis Waller; Athanasios K. Ziliaskopoulos

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 166 KB
Volume: 40
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10049

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest Path Problems with Time Windows

Shortest Path Problems with Time Windows on Nodes and Arcs

✍ N.G.F. Sancho 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Solving the all-pair shortest path query

Solving the all-pair shortest path query problem on interval and circular-arc graphs

✍ Chen, Danny Z.; Lee, D. T.; Sridhar, R.; Sekharan, Chandra N. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 3 views

In this paper, we study the following all-pair shortest path query problem: Given the interval model of an unweighted interval graph of n vertices, build a data structure such that each query on the shortest path (or its length) between any pair of vertices of the graph can be processed efficiently

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