1. National traveling salesman problems.
http://www.math.uwaterloo.ca/tsp/world/countries.html
. Accessed 15 Dec 2014
2. Almi’ani, K., Viglas, A., Libman, L.: Tour and path planning methods for efficient data gathering using mobile elements. Int. J. Ad Hoc Ubiquitous Comput. (2014)
3. Anastasi, G., Conti, M., Di Francesco, M.: Data collection in sensor networks with data mules: an integrated simulation analysis. In: IEEE Symposium on Computers and Communications, ISCC 2008, pp. 1096–1102, July 2008
4. Archer, A., Bateni, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for prize-collecting steiner tree and tsp. SIAM J. Comput. 40(2), 309–332 (2011)
5. Archetti, C., Speranza, M., Vigo, D.: Vehicle routing problems with profits. Technical report WPDEM2013/3, University of Brescia (2013)