1. J.D.C., Little, K.G., Murty, D.W., Sweeney, C., Karel, An Algorithm for the Traveling Salesman Problem, Working paper, School of Industrial Management, Massachusetts Institute of Technology, 1963.
2. Travelling salesman problem using reduced algorithmic Branch and bound approach;Ranjana;Int. J Pure Appl. Math.,2018
3. Solving the travelling salesman problem using the Branch and Bound Method;Mataija,2016
4. Optimized path planning for dimensional inspection on coordinate measuring machine (CMM);Karthikeyan;J. Comput. Aided Manuf. Autom.,2016
5. Ones assignment method for solving traveling salesman problem;Basirzadeh;J. Math. Comput. Sci.,2014