1. Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2006). The traveling salesman problem: A computational study. Princeton, NJ: Princeton University Press.
2. Asano, T., Bhattacharya, B., Keil, M., & Yao, F. (1988). Clustering algorithms based on minimum and maximum spanning trees. In Proceedings of the Fourth Annual Symposium on Computational Geometry (SCG ’88) (pp. 252–257). New York, NY: ACM. doi: 10.1145/73393.73419
3. Best, B. J. (2005). A model of fast human performance on a computationally hard problem. In B. G. Bara, L. Barsalou, & M. Bucciarelli (Eds.), Proceedings of the 27th Annual Conference of the Cognitive Science Society (pp. 256–261). Mahwah, NJ: Erlbaum.
4. Bland, R. E., & Shallcross, D. F. (1987). Large traveling salesman problem arising from experiments in x-ray crystallography: A preliminary report on computation (Technical Report No. 730). Ithaca, NY: Cornell University, School of Operations Research and Information Engineering.
5. Clark, P. J., & Evans, F. C. (1954). Distance to nearest neighbor as a measure of spatial relationships in populations. Ecology, 35, 445–453.