✦ LIBER ✦

A shortest path algorithm for moving objects in spatial network databases

✍ Scribed by Xiaolan Yin; Zhiming Ding; Jing Li

Book ID: 113855723
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 511 KB
Volume: 18
Category: Article
ISSN: 1002-0071
DOI: 10.1016/j.pnsc.2008.01.031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Algorithms for Shortest Paths

Efficient Algorithms for Shortest Paths in Sparse Networks

✍ Johnson, Donald B. 📂 Article 📅 1977 🏛 Association for Computing Machinery 🌐 English ⚖ 833 KB

A bi-objective approach for shortest-pat

A bi-objective approach for shortest-path network interdiction

✍ Claudio M. Rocco S.; José Emmanuel Ramirez-Marquez 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 793 KB

In the literature, solution approaches to the shortest-path network interdiction problem have been developed for optimizing a single figure-of-merit of the network configuration when considering limited amount of resources available to interdict network links. This paper presents a newly developed e

A k shortest path algorithm for adaptive

A k shortest path algorithm for adaptive routing in communications networks

✍ Topkis, D.M. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 708 KB

An algorithm for determining the shortes

An algorithm for determining the shortest path on a network graph

✍ S.M. Alekseeva; O.G. Alekseev 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 568 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

A hill-jump algorithm of Hopfield neural

A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network

✍ Rong-Long Wang; Shan-Shan Guo; Kozo Okazaki 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 314 KB