✦ LIBER ✦

Reversibility of the time-dependent shortest path problem

✍ Scribed by Carlos F. Daganzo

Book ID: 117397199
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 53 KB
Volume: 36
Category: Article
ISSN: 0191-2615
DOI: 10.1016/s0191-2615(01)00012-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The approach-dependent, time-dependent,

The approach-dependent, time-dependent, label-constrained shortest path problem

✍ Hanif D. Sherali; Chawalit Jeenanunta; Antoine G. Hobeika 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

Computation of the Reverse Shortest-Path

Computation of the Reverse Shortest-Path Problem

✍ Jianzhong Zhang; Yixun Lin 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 292 KB

Time depending shortest-path problems wi

Time depending shortest-path problems with applications to railway networks

✍ K. Nachtigall 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 761 KB

On the Complexity of Time-Dependent Shor

On the Complexity of Time-Dependent Shortest Paths

✍ Luca Foschini, John Hershberger, Subhash Suri 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 736 KB

The time-dependent shortest pair of disj

The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms

✍ Sherali, Hanif D.; Ozbay, Kaan; Subramanian, Shivaram 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 3 views

In this paper, we examine complexity issues, models, and algorithms for the problem of finding a shortest pair of disjoint paths between two nodes of a network such that the total travel delay is minimized, given that the individual arc delays are time-dependent. Such disjoint paths address the issu

Shortest Paths in Time-Dependent FIFO Ne

Shortest Paths in Time-Dependent FIFO Networks

✍ Frank Dehne; Masoud T. Omran; Jörg-Rüdiger Sack 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 776 KB