1. Ahuja R.K., Magnanti T.M., Orlin J.B., Network Flows – Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. Chabini I., Lan S., Adaptation of the A* algorithm for computation of faster paths in deterministic discrete-time dynamic networks, IEEE. Trans. on Intel. Trans. Syst. 3 (2002), 60–74.
3. Cormen T.H., Leiserson C.E., Rivest R.L., Introduction of Algorithms, Second Edition, The MIT Press, 2001.
4. Hart E.P., Nilson N.J., Raphael B., A formal basis for the heuristic determination of minimum cost path, IEEE Trans. Syst. Sci. Cybern. 4 (1968), 100–107.
5. Hersberger J., Suri S., On computing Euclidean shortest paths in the plane, Proc. 34 Annu. IEEE. Sympos. Found, Comput. Sci. (1993), 508–517.
6. Ghosh S.K., Mount D.M., An output-sensitive algorithm for computing visibility graphs, SIAM J. Computing 20 (1991), 888–910.
7. Kapoor S., Maheshwari S.N., Mitchell J.S.B., An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane, Discrete Comput. Geom. 18 (1997), 377–383.
8. Mitchell J.S.B., Geometric Shortest Paths and Network Optimization, In: Handbook of Computational Geometry, Elsevier Science (J.-R. Sack and J. Urrutia, eds.), 2000, pp. 633–701.
9. O’Rourke J., Computational Geometry in C, Cambridge University Press, New York, 1995.
10. Pallottino S., Shortest paths Method – Complexity Interrelations and New Propositions, Consiglio Nazionale delle Ricerche, Istituto per le Aplicazioni del Calcolo “Mauro Picone”, Roma, 14 (1984), 257–267.
11. Pohl I., Heuristic search viewed as path finding in a graph, Artif. Intell. 1 (1970), 193–204.
Google Scholar