✦ LIBER ✦

On Dynamic Shortest Paths Problems

✍ Scribed by Liam Roditty; Uri Zwick

Publisher: Springer
Year: 2010
Tongue: English
Weight: 702 KB
Volume: 61
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-010-9401-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic programming solution of a shor

A dynamic programming solution of a shortest path problem with time constraints on movement and parking

✍ N.G.F Sancho 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 310 KB

On Bounded Leg Shortest Paths Problems

✍ Liam Roditty; Michael Segal 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 538 KB

Iterative methods for dynamic stochastic

Iterative methods for dynamic stochastic shortest path problems

✍ Raymond K. Cheung 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

We consider a routing policy that forms a dynamic shortest path in a network with independent, positive and discrete random arc costs. When visiting a node in the network, the costs for the arcs going out of this node are realized, and then the policy will determine which node to visit next with the

Dynamic shortest path problems with time

Dynamic shortest path problems with time-varying costs

✍ S. Mehdi Hashemi; Shaghayegh Mokarami; Ebrahim Nasrabadi 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 276 KB

On a multicriteria shortest path problem

✍ Ernesto Queirós Vieira Martins 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 617 KB

Fuzzy shortest path problem

✍ Shinkoh Okada; Mitsuo Gen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 269 KB