✦ LIBER ✦

Min-Max quickest path problems

✍ Scribed by Stefan Ruzika; Markus Thiemann

Book ID: 112163204
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 106 KB
Volume: 60
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.21473

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The quickest path problem

✍ Y.L. Chen; Y.H. Chin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 822 KB

Algorithms for the quickest path problem

Algorithms for the quickest path problem and the reliable quickest path problem

✍ Herminia I. Calvete; Lourdes del-Pozo; José A. Iranzo 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 260 KB

On the quickest path problem

✍ Gen-Huey Chen; Yung-Chen Hung 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Solving min-max shortest-path problems o

Solving min-max shortest-path problems on a network

✍ Ishwar Murthy; Shenq-Shyong Her 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 877 KB

In this article we consider the problem of determining a path between two nodes in a network that minimizes the maximum of r path length values associated with it. This problem has a direct application in scheduling. It also has indirect applications in a class of routing problems and when consideri

Algorithms for the quickest path problem

Algorithms for the quickest path problem and the enumeration of quickest paths

✍ J.B. Rosen; S.-Z. Sun; G.-L. Xue 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 644 KB

Algorithms for the constrained quickest

Algorithms for the constrained quickest path problem and the enumeration of quickest paths

✍ Chen Gen-Huey; Hung Yung-Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 616 KB