Dijkstra's algorithm has long been the quickest way of finding the shortest possible paths in a network, but researchers have ...

This is a preview. Log in through your library . Abstract We consider the optimal stopping problem for g(Zn), where Zn, n = 1,2,..., is a homogeneous Markov sequence. An algorithm, called forward ...