𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shortest viable path algorithm in multimodal networks

✍ Scribed by Angelica Lozano; Giovanni Storchi

Book ID
117675522
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
349 KB
Volume
35
Category
Article
ISSN
0965-8564

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest-Path Routing in Arbitrary Netwo
Shortest-Path Routing in Arbitrary Networks
✍ Friedhelm Meyer auf der Heide; Berthold Vöcking 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 197 KB

We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in Ž . O C q D q log N steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for

A utility measure for finding multiobjec
A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
✍ Paola Modesti; Anna Sciomachen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 334 KB

In this paper we study the problem of ®nding Origin±Destination (O±D) shortest paths in urban multimodal transportation networks, aiming at minimizing the overall cost, time and users' discommodity associated with the required paths. We present an approach based on the classical shortest path proble