References
- Ahuja, R.K., Magnanti, T.L. , and Orlin, J.B., 1993. Network flows: theory, algorithms, and applications. Englewood Cliffs, NJ: Prentice Hall.
- Akgun, V., Erkut, E. , and Batta, R., 2000. On finding dissimilar paths. European Journal of Operational Research, 121 (2), 232–246.
- Bellman, R., 1958. On a routing problem. Quarterly of Applied Mathematics, 16, 87–90.
- Cheung, R.K., 1998. Iterative methods for dynamic stochastic shortest path problems. Naval Research Logistics, 45 (8), 769–789.
- Croucher, J.S., 1978. A note on the stochastic shortest-route problem, Naval Research Logistics Quarterly, 25 (4), 729–732.
- Dell’Olmo, P., Gentili, M. , and Scozzari, A., 2005. On finding dissimilar Pareto-optimal paths. European Journal of Operational Research, 162 (1), 70–82.
- Deng, Y., et al., 2012. Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment. Applied Soft Computing, 12 (3), 1231–1237.
- Dijkstra, E.W., 1959. A note on two problems in connexion with graphs. NumerischeMathematik, 1, 269–271.
- Dubois, D. and Prade, H., 1980. Fuzzy sets and systems: Theory and applications. New York, NY: Academic Press.
- Fan, Y., Kalaba, R. , and Moore, J., 2005. Arriving on time. Journal of Optimization Theory and Applications, 127 (3), 497–513.
- Ford Jr, L.R. and Fulkerson, D.R., 1962. Flows in networks. Princeton, NJ: Princeton University Press .
- Frank, H., 1969. Shortest paths in probabilistic graphs. Operations Research, 17 (4), 583–599.
- Fredman, M.L. and Tarjan, R.E., 1987. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association for Computing Machinery, 34 (3), 596–615.
- Gao, Y., 2011. Shortest path problem with uncertain arc lengths. Computers & Mathematics with Applications, 62 (6), 2591–2600.
- Hart, P.E., Nilsson, N.J. , and Raphael, B., 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4 (2), 100–107.
- Ji, X., Iwamura, K. , and Shao, Z., 2007. New models for shortest path problem with fuzzy arc lengths. Applied Mathematical Modelling, 31 (2), 259–269.
- Kamburowski, J., 1985. A note on the stochastic shortest route problem. Operations Research, 33 (3), 696–698.
- Kanza, Y., Safra, E. , and Sagiv, Y., 2009 . Route search over probabilistic geospatial data. In: N. Mamoulis, T. Seidl, T. B. Pedersen, K. Torp, and I. Assent, eds. Proceedings of the 11th international symposium, SSTD 2009, Aalborg, Denmark, Advances in Spatial and Temporal Databases, Lecture Notes in Computer Science 5644, Berlin:Springer-Verlag, 153–170.
- Kung, J.-Y. and Chuang, T.-N., 2005. The shortest path problem with discrete fuzzy arc lengths. Computers and Mathematics with Applications, 49 (2–3), 263–270.
- Liu, W. , 2010 . Uncertain programming models for shortest path problem with uncertain arc lengths. In: D.A. Ralescu, J. Peng, and R. Guo, eds. Proceedings of the first international conference on uncertainty theory, Urumchi, China, August 11–19, 2010, Beijing: China National Knowledge Infrastructure, 148–153.
- Nikolova, E., et al., 2006 . Stochastic shortest paths via quasi-convex maximization. In: Y. Azar, ed. Proceedings of the 14th annual European symposium on algorithms (ESA ‘06), Lecture Notes in Computer Science 4168, Berlin: Springer-Verlag, 552–563.
- Pallottino, S. and Scutellà, M.G., 1998. Shortest path algorithms in transportation models: classical and innovative aspects. In: P. Marcotte and S. Nguyen , eds. Equilibrium and advanced transportation modelling, Boston, MA: Kluwer Academic Publishing, 245–281 .
- Polychronopoulos, G.H. and Tsitsiklis, J.N., 1996. Stochastic shortest path problems with recourse. Networks, 27 (2), 133–143.
- Sigal, C.E., Pritsker, A.A.B. , and Solberg, J.J., 1980. The stochastic shortest route problem. Operations Research, 28 (5), 1122–1129.