1. I. G. Chernorutskii, Optimization Methods. Computer Technologies (BKhV-Peterburg, St. Petersburg, 2011) [in Russian].
2. D. A. Beloglazov, V. F. Guzik, E. Yu. Kosenko, V. A. Krukhmalev, M. Yu. Medvedev, V. A. Pereveraev, V. Kh. Pshikhopov, A. O. P’yavchenko, R. V. Saprykin, V. V. Solov’ev, V. I. Finaev, Yu. V. Chernukhin, and I. O. Shapovalov, Intellectual Planning of Trajectories of Moving Objects in Environments with Obstacles (Fizmatlit, Moscow, 2014) [in Russian].
3. E. Köhler, R. H. Möhring, and H. Schilling, “Acceleration of shortest path and constrained shortest path computation,” in Experimental and Efficient Algorithms, Proceedings of the 4th Workshop on Experimental Algorithms (WEA’05), Santorini Island,
2005, pp. 126–138.
4. A. V. Goldberg and R. F. Werneck, “Computing point-to-point shortest paths from external memory,” in Proceedings of the 7th Workshop on Algorithm Engineering and Experiments and the 2nd Workshop on Analytic Algorithmics and Combinations, Vancouver,
2005, pp. 26–40.
5. E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numer. Math. 1, 269–271 (1959).