Researchers have combined the Dijkstra and Bellman-Ford algorithms to develop an even faster way to find the shortest paths ...
The computation of point-to-point shortest paths on time-dependent transportation networks has many practical applications. Finding the shortest path on transportation networks, taking into account ...
Vol. 52, No. 1, Special Issue on Uncertainty in Logistics and Transportation Systems (January–February 2018), pp. 80-101 (22 pages) This study addresses various formulations of the optimal reliability ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback