References
- E. Çela, V.G. Deineko, G.J. Woeginger, The multi-stripe travelling salesman problem. Annals of Operations Research. vol 2017 (2017) 1–14.
- L. Liu, H. Mu, J. Yang, Toward algorithms for multi-modal shortest path problem and their extension in urban transit network. Journal of Intelligent Manufacturing. vol 28 (2017) 767–781. doi: 10.1007/s10845-014-1018-0
- A.A. Coco, J.C.A. Júnior, T.F. Noronha, Santos A.C. Erratum to: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. Journal of Global Optimization. vol 68 (2017) 463–466. doi: 10.1007/s10898-017-0511-3
- G.H. Shirdel, M. Abdolhosseinzadeh, The shortest path problem in the stochastic networks with unstable topology. Springerplus. vol 5 (2016) 1529. doi: 10.1186/s40064-016-3180-7
- Q. Bui, Y. Deville, Q. Pham, Exact methods for solving the elementary shortest and longest path problems. Annals of Operations Research. vol 244 (2016) 313–348. doi: 10.1007/s10479-016-2116-5
- R. Schott, G.S. Staples, Generalized Zeon Algebras: Theory and Application to Multi-Constrained Path Problems. Advances in Applied Clifford Algebras. vol 27 (2017) 45–57. doi: 10.1007/s00006-015-0595-0
- A. Hidalgo-Paniagua, M. Vega-Rodríguez, J. Ferruz, N. Pavón, Solving the multi-objective path planning problem in mobile robotics with a firefly-based approach. Soft Computing - A Fusion of Foundations, Methodologies & Applications. vol 21 (2017) 949–964.
- H. Li, Y. Xu, G. Ni, Minimax regret vertex 2-sink location problem in dynamic path networks. J. Comb. Optim.. vol 31 (2016) 79–94. doi: 10.1007/s10878-014-9716-2
- S. Behzadi, A.A. Alesheikh, E. Poorazizi, Developing a Genetic Algorithm to Solve Shortest Path Problem on a Raster Data Model. Journal of Applied Sciences. vol 8 (2008) 3289–3293. doi: 10.3923/jas.2008.3289.3293
- S. Effati, M. Jafarzadeh, Nonlinear Neural Networks for Solving the Shortest Path Problem. Applied Mathematics and Computation. vol 189 (2007) 567–574. doi: 10.1016/j.amc.2006.11.171