This paper considers a stochastic shortest path problem where the arc lengths are independent random variables following a normal distribution. In this problem, the optimal path is one that maximizes ...

They settled on the negative-weight shortest-paths problem and invited Aaron Bernstein of Rutgers University to join them. Christian Wulff-Nilsen was looking for an ambitious problem to tackle with ...

Dimitri P. Bertsekas, John N. Tsitsiklis, An Analysis of Stochastic Shortest Path Problems, Mathematics of Operations Research, Vol. 16, No. 3 (Aug., 1991), pp. 580-595 ...

Facts about the single source shortest path problem The aim of the single source shortest path problem is to find the shortest paths from a given starting node to all other nodes in a network.