1. Albert, R., Baraba´ si, A.-L., 2002, Statistical mechanics of complex networks. Reviews of Modern Physics 74, 47–97.
2. Akandwanaho S.M., Adewumi A.O., Adebiyi A.A., 2015, Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression, Journal of Applied Mathematics, vol. 2014, Article ID 818529, 10 pages.
3. Appert M., Chapelon L., 2013, Measuring Urban Road Network Vulnerability using Graph Theory: The Case of Montpellier’s Road Network. Working Paper, halshs-00841520, Version 1-8.
4. Applegate D.L., Robert E., Bixby R.E., Vasek Chvátal V., Cook W.J., 2007, The Traveling Salesman Problem: A Computational Study, Princeton Series in Applied Mathematics.
5. Arora S., 1998, Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems, Journal of the ACM, 45 (5): 753–782, CiteSeerX 10.1.1.23.6765, doi:10.1145/290179.290180.