✦ LIBER ✦

Time version of the shortest path problem in a stochastic-flow network

✍ Scribed by Yi-Kuei Lin

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 543 KB
Volume: 228
Category: Article
ISSN: 0377-0427
DOI: 10.1016/j.cam.2008.09.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the -shortest path problem with

Solving the -shortest path problem with time windows in a time varying network

✍ Konstantinos N. Androutsopoulos; Konstantinos G. Zografos 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 922 KB

The k-shortest path problem in a network with time dependent cost attributes arises in many transportation decisions including hazardous materials routing and urban trip planning. The present paper proposes a label setting algorithm for solving this problem given that departure and arrival are const

Finding the Kth shortest path in a time-

Finding the Kth shortest path in a time-schedule network

✍ Yen-Liang Chen; Kwei Tang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

A note on Arc tolerances in sparse short

A note on Arc tolerances in sparse shortest-path and network flow problems

✍ Dan Gusfield 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 298 KB 👁 1 views

A temporal ant colony optimization appro

A temporal ant colony optimization approach to the shortest path problem in dynamic scale-free networks

✍ Feng Yu; Yanjun Li; Tie-Jun Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 834 KB

A mean-time comparison of algorithms for

A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths

✍ W. D. Kelton; A. M. Law 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB

The problem of the uniform distribution

The problem of the uniform distribution of the flow in a network

✍ N.K. Belenova 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 630 KB