✦ LIBER ✦

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

✍ Scribed by Hanif D. Sherali; Chawalit Jeenanunta; Antoine G. Hobeika

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 181 KB
Volume: 48
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20120

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the online shortest path problem with

On the online shortest path problem with limited arc cost dependencies

✍ S. Travis Waller; Athanasios K. Ziliaskopoulos 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

Improved preprocessing, labeling and sca

Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem

✍ I. Dumitrescu; N. Boland 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB