A Polynomial-Time Algorithm to Find Shortest Paths with Recourse

Networks

Volumn 41, Issue 2, 2003, Pages 115-125

  Provan, J Scott ^a  

^a The University of North Carolina at Chapel Hill   (United States)

Author keywords

Dijkstra; Dynamic shortest path; Recourse; Shortest path; Stochastic network

Indexed keywords

DIJKSTRA; DYNAMIC SHORTEST PATH; RECOURSE; SHORTEST PATH; STOCHASTIC NETWORKS;

COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING;

OPERATIONS RESEARCH;

EID: 2142848610     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10063     Document Type: Article

References (10)

1. G. Andreatta and L. Romeo, Stochastic shortest paths with recourse, Networks 18 (1988), 193-204.
2. R.K. Cheung, Iterative methods for dynamic stochastic shortest path problems, Naval Res Log 45 (1998), 769-789.
3. J. Croucher, A note on the stochastic shortest route problem, Naval Res Log Q 25 (1978), 729-732.
4. M.O. Ball, C. Colbourn, and J.S. Provan, "Network reliability," Handbooks in OR & MS 7, Elsevier, Amsterdam, 1995, Chapter 11, pp. 673-762.
5. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979.
6. R. Hall, The fastest path through a network with random time-dependent travel times, Trans Sci 20 (1994), 182-188.
7. E. Miller-Hooks, Adaptive least-expected time paths in stochastic, time-varying transportation and data networks, Networks 37 (2001), 35-52.
8. G.H. Polychronopoulos and J.N. Tsitsiklis, Stochastic shortest path problems with recourse, Networks 27 (1996), 133-143.
9. H.N. Psaraftis and J.N. Tsitsiklis, Dynamic shortest paths in acyclic networks with Markovian arc costs, Oper Res 41 (1993), 91-101.
10. S. Ross, Introduction to stochastic dynamic programming, Academic Press, New York, 1983.