1. Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
2. Berman, P., Karpinski, M.: 8/7 - approximation algorithm for (1, 2) - TSP. In: Proceedings of the 17th ACM-SIAM SODA Conference, pp. 641–648 (2006)
3. Branch, J., Freeman, M., Halaka, S.: Prim’s Minimum Spanning Tree, Section 3.3.
http://www.cs.rpi.edu/~musser/gp/algorithm-concepts/prim-screen.pdf
. Accessed 06 June 2019
4. Cook, W.J.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton (2012)
5. Gondzio, J.: Interior point methods: 25 years later. Eur. J. Oper. Res. 218, 587–601 (2012)