✦ LIBER ✦

On the quickest path problem

✍ Scribed by Gen-Huey Chen; Yung-Chen Hung

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 368 KB
Volume: 46
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90057-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The all-pairs quickest path problem

✍ D.T. Lee; E. Papadopoulou 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 625 KB

Finding the k quickest simple paths in a

Finding the k quickest simple paths in a network

✍ Y.L. Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 391 KB

On optimum path problems

✍ R. E. Thomas 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 734 KB

A note on the constrained shortest-path

A note on the constrained shortest-path problem

✍ Arun K. Pujari; Suneeta Agarwal; V. P. Gulati 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

On the minimum path problem in Knödel gr

On the minimum path problem in Knödel graphs

✍ Hovhannes A. Harutyunyan; Calin D. Morosan 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

The probabilistic longest path problem

✍ Murat, C�cile; Paschos, Vangelis Th. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

We study the probabilistic longest path problem. We propose a modification strategy adapting a solution for a deterministic instance to a solution for the probabilistic one, we compute the functional associated with this strategy, and we evaluate the complexities of computing this functional and of