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 ...

Mathematics of Operations Research, Vol. 16, No. 3 (Aug., 1991), pp. 580-595 (16 pages) We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

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.