𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Speeding up the Floyd–Warshall algorithm for the cycled shortest path problem

✍ Scribed by Asghar Aini; Amir Salehipour


Book ID
113449206
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
298 KB
Volume
25
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Dual algorithms for the shortest path tr
✍ Pallottino, Stefano; Scutell�, Maria Grazia 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 2 views

We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution and propose a new family of dual ascent algorithms. In these algorithms, ''local'' and