1. Tamás , K. , Giovanni , G. , Bendegúz , D. B. 2017. The Multiagent Planning Problem. Complexity : pp. 12 . Tamás, K., Giovanni, G., Bendegúz, D. B. 2017. The Multiagent Planning Problem. Complexity: pp.12.
2. Li W. 2020. Solution Attractor of Local Search System: A Method to Reduce Computational Complexity of the Traveling Salesman Problem. In: Donald D. (Eds.). Novel Trends in the Traveling Salesman Problem. IntechOpen. Chapter 3. Li W. 2020. Solution Attractor of Local Search System: A Method to Reduce Computational Complexity of the Traveling Salesman Problem. In: Donald D. (Eds.). Novel Trends in the Traveling Salesman Problem. IntechOpen. Chapter 3.
3. Xing Z. Tu S. Xu l. 2020. Solve Traveling Salesman Problem by Monte Carlo Tree Search and Deep Neural Network. https://arxiv.org/pdf/2005.06879.pdf. Xing Z. Tu S. Xu l. 2020. Solve Traveling Salesman Problem by Monte Carlo Tree Search and Deep Neural Network. https://arxiv.org/pdf/2005.06879.pdf.
4. Solving Multiple Traveling Salesman Problem using the Gravitational Emulation Local Search;Shokouhi Rostami A.;Algorithm. Appl. Math. Inf. Sci.,2015
5. Xu , M. , Li , S. , Guo , J. 2017 . Optimization of Multiple Traveling Salesman Problem Based on Simulated Annealing Genetic Algorithm. In: MATEC Web of Conferences. Cohasset. pp. 100 . Xu,M., Li, S., Guo, J. 2017. Optimization of Multiple Traveling Salesman Problem Based on Simulated Annealing Genetic Algorithm. In: MATEC Web of Conferences. Cohasset. pp.100.