𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shortest Path Problems with Time Windows on Nodes and Arcs

✍ Scribed by N.G.F. Sancho

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
180 KB
Volume
186
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

Time-varying shortest path problems with
Time-varying shortest path problems with constraints
✍ Cai, X.; Kloks, T.; Wong, C. K. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 159 KB

We study a new version of the shortest path problem. Let G Γ… (V, E) be a directed graph. Each arc e √ E has two numbers attached to it: a transit time b(e, u) and a cost c(e, u), which are functions of the departure time u at the beginning vertex of the arc. Moreover, postponement of departure (i.e.

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