✦ LIBER ✦

Shortest path problems with node failures

✍ Scribed by Patrick Jaillet

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 808 KB
Volume: 22
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230220607

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

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.

Fuzzy shortest path problem

✍ Shinkoh Okada; Mitsuo Gen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Recoverable robust shortest path problem

Recoverable robust shortest path problems

✍ Christina Büsing 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

## Abstract In this article, we investigate two different recoverable robust (RR) models to deal with cost uncertainties in a shortest path problem. RR extends the classical concept of robustness to deal with uncertainties by incorporating limited recovery actions after the full data are revealed.

The constrained shortest path problem

✍ Y. P. Aneja; K. P. K. Nair 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB

Inapproximability results for the invers

Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths

✍ Andreas Bley 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract We study the complexity of two inverse shortest paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph __D__ = (__V__, __A__), the task is to find positive integer arc lengths such that th