𝔖 Bobbio Scriptorium

✦ LIBER ✦

Point-to-point shortest paths on dynamic time-dependent road networks

✍ Scribed by Giacomo Nannicini

Book ID: 106308281
Publisher: Springer
Year: 2010
Tongue: English
Weight: 93 KB
Volume: 8
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-010-0121-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient time and space K point-to-p

An efficient time and space K point-to-point shortest simple paths algorithm

✍ Antonio Sedeño-Noda 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 720 KB

Time depending shortest-path problems wi

Time depending shortest-path problems with applications to railway networks

✍ K. Nachtigall 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 761 KB

[Lecture Notes in Computer Science] Adva

[Lecture Notes in Computer Science] Advances in Spatial and Temporal Databases Volume 6849 || A Critical-Time-Point Approach to All-Start-Time Lagrangian Shortest Paths: A Summary of Results

✍ Pfoser, Dieter; Tao, Yufei; Mouratidis, Kyriakos; Nascimento, Mario A.; Mokbel, 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 437 KB

[IEEE 2011 International Conference on N

[IEEE 2011 International Conference on Network Computing and Information Security (NCIS) - Guilin, China (2011.05.14-2011.05.15)] 2011 International Conference on Network Computing and Information Security - A Fixed Point Algorithm for Noisy Time-Dependent Processes Using AR Source Model

✍ Yang, Yumin 📂 Article 📅 2011 🏛 IEEE ⚖ 322 KB

[IEEE 2011 14th International IEEE Confe

[IEEE 2011 14th International IEEE Conference on Intelligent Transportation Systems - (ITSC 2011) - Washington, DC, USA (2011.10.5-2011.10.7)] 2011 14th International IEEE Conference on Intelligent Transportation Systems (ITSC) - Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems

✍ Gao, Yang; Chiu, Yi-Chang 📂 Article 📅 2011 🏛 IEEE ⚖ 723 KB