Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
暂无分享,去创建一个
[1] H. Frank,et al. Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..
[2] H. Chen,et al. A dynamic program for minimum cost ship routing under uncertainty , 1978 .
[3] Alan M. Frieze,et al. The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..
[4] Patrick Jaillet,et al. Probabilistic Traveling Salesman Problems , 1985 .
[5] Randolph W. Hall,et al. The Fastest Path through a Network with Random Time-Dependent Travel Times , 1986, Transp. Sci..
[6] Dimitri P. Bertsekas,et al. Dynamic Programming: Deterministic and Stochastic Models , 1987 .
[7] D. Bertsimas. Probabilistic combinatorial optimization problems , 1988 .
[8] A N Perakis,et al. NEW MODELS FOR MINIMAL TIME SHIP WEATHER ROUTING , 1988 .
[9] Dimitris Bertsimas,et al. A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..
[10] John N. Tsitsiklis,et al. An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..
[11] Patrick Jaillet,et al. Shortest path problems with node failures , 1992, Networks.