共 29 条
[1]
Adlakha V. G.(1986)An improved conditional Monte-Carlo technique for stochastic shortest route problem Manage. Sci. 32 1360-1367
[2]
Bard J. F.(1991)Arc reduction and path preference in stochastic acyclic networks Manage. Sci. 31 198-215
[3]
Bennett J. E.(1959)On random graphs Publ. Math 6 290-297
[4]
Erdős P.(1960)On the evolution of random graphs Pub. Math. Inst. Hungarian Acad. Sci. 5 17-61
[5]
Rényi A.(1961)On the strength of connectedness of a random graph Acta Math. Hung. 12 261-267
[6]
Erdős P.(1969)Shortest paths in probabilistic graphs Oper. Res. 17 583-599
[7]
Rényi A.(1990)Risk criteria in a stochastic knapsack problem Oper. Res. 38 820-825
[8]
Erdős P.(1992)Shortest paths problems with node failures Networks 22 589-605
[9]
Rényi A.(1985)A note on the stochastic shortest route problem Oper. Res. 33 696-698
[10]
Frank H.(1983)Optimal paths in graphs with stochastic or multidimensional weights Commun. ACM 26 670-676