论文信息 - Dealing with uncertainty in network optimisation - 字舞流文

Dealing with uncertainty in network optimisation

[1] Xiaoyu Ji,et al. Models and algorithm for stochastic shortest path problem , 2005, Appl. Math. Comput..

[2] Roberto Montemanni,et al. An exact algorithm for the robust shortest path problem with interval data , 2004, Comput. Oper. Res..

[3] D. Shier,et al. An empirical investigation of some bicriterion shortest path algorithms , 1989 .

[4] Luis C. Dias,et al. Shortest path problems with partial information: Models and algorithms for detecting dominance , 2000, Eur. J. Oper. Res..

[5] D. D. M. L. Rasteiro,et al. Optimal Paths in Probabilistic Networks , 2004 .

[6] Roberto Montemanni,et al. The robust shortest path problem with interval data via Benders decomposition , 2005, 4OR.

[7] Roberto Montemanni,et al. A branch and bound algorithm for the robust shortest path problem with interval data , 2004, Oper. Res. Lett..