1. Ahuza, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network flows: Theory, alogorithm, and applications, Prentice Hall, N.J.
2. Azevedo, J. A., Costa, M. E. O. S., Madeira, J. J. E. R. S., and Martins, E. Q. V. (1993). “An algorithm from the ranking of shortest paths.” European Journal of Operational Research, Vol. 69, No. 1, pp. 97–106.
3. Barra, T., Perez, B. and Anez, J. (1993). “Multidimensional path search and assignment.” Proc. 21st PTRC Summer Annual Conference, PTRC, Manchester, England, pp. 307–319.
4. Berg Insight (2008). Personal navigation devices, Gothenburg, Sweden, http://www.berginsight.com/ShowReport.aspx?m_m=3&id=77 , (Accessed Apr. 6, 2009).
5. Dreyfus, S. E. (1969). “An appraisal of some shortest-path algorithms.” Operations Research, Vol. 17, No. 3, pp. 395–412.