✦ LIBER ✦

An algorithm for finding the k quickest paths in a network

✍ Scribed by Y.L. Chen

Book ID: 107950917
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 652 KB
Volume: 20
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(93)90096-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A genetic algorithm for finding the k sh

A genetic algorithm for finding the k shortest paths in a network

✍ Ahmed Younes Hamed 📂 Article 📅 2010 🏛 Elsevier 🌐 English ⚖ 801 KB

An Algorithm for finding optimum path in

An Algorithm for finding optimum path in networks

✍ Kabekode V.S. Bhat 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 242 KB

In this paper we present an O((V( . loglV() algorithm forfinding an optimum path between two nodes in an edge-sparse network using a new approach. The method exploits the data structure and a simple breadth-first search process.

K⁎: A heuristic search algorithm for fin

K⁎: A heuristic search algorithm for finding the k shortest paths

✍ Husain Aljazzar; Stefan Leue 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 724 KB

An algorithm for finding reasonable path

An algorithm for finding reasonable paths in transit networks

✍ Man-chun Tan; C. O. Tong; S. C. Wong; Jian-min Xu 📂 Article 📅 2007 🏛 Institute for Transportation Inc. 🌐 English ⚖ 299 KB

An O(K·n4) algorithm for finding the k b

An O(K·n4) algorithm for finding the k best cuts in a network

✍ Horst Hamacher 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 205 KB