Stochastic shortest path problems with recourse
暂无分享,去创建一个
[1] Pitu B. Mirchandani. Shortest distance and reliability of probabilistic networks , 1976, Comput. Oper. Res..
[2] J. Croucher. A note on the stochastic shortest‐route problem , 1978 .
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[5] Refael Hassin,et al. On Shortest Paths in Graphs with Random Weights , 1985, Math. Oper. Res..
[6] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[7] Giovanni Andreatta,et al. Stochastic shortest paths with recourse , 1988, Networks.
[8] Baruch Schieber,et al. The Canadian Traveller Problem , 1991, SODA '91.
[9] John N. Tsitsiklis,et al. An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..
[10] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..
[11] George H. Polychronopoulos. Stochastic and dynamic shortest distance problems , 1992 .
[12] John N. Tsitsiklis,et al. Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs , 1993, Oper. Res..