Publisher
Springer Nature Switzerland
Reference21 articles.
1. Ahmed, Z.H.: The ordered clustered travelling salesman problem: a hybrid genetic algorithm. Sci. World J. 2014, 258207 (2014)
2. Chisman, J.A.: The clustered traveling salesman problem. Comput. Oper. Res. 2(2), 115–119 (1975)
3. Dasari, K.V., Singh, A.: Two heuristic approaches for clustered traveling salesman problem with d-relaxed priority rule. Expert Syst. Appl. 224, 120003 (2023)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)
5. Hà, M.H., Nguyen Phuong, H., Tran Ngoc Nhat, H., Langevin, A., Trépanier, M.: Solving the clustered traveling salesman problem with $$d$$-relaxed priority rule. Int. Trans. Oper. Res. 29(2), 837–853 (2022)