✦ LIBER ✦

A note on the stochastic shortest-route problem

✍ Scribed by John S. Croucher

Publisher: John Wiley and Sons
Year: 1978
Tongue: English
Weight: 174 KB
Volume: 25
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800250415

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A note on k-shortest paths problem

✍ Nick Gravin; Ning Chen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views

It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this article, we generalize this to shortest k edgedisjoint s-t path

A note on the problem of updating shorte

A note on the problem of updating shortest paths

✍ Satoru Fujishige 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views

A note on shortest path, assignment, and

A note on shortest path, assignment, and transportation problems

✍ A. J. Hoffman; H. M. Markowitz 📂 Article 📅 1963 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB 👁 1 views

A note on a stochastic production-maximi

A note on a stochastic production-maximizing transportation problem

✍ Uri Yechiali 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

A note on finding shortest path trees

✍ Aaron Kershenbaum 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views