Author:
Majumder Sebanti,Singh Alok
Publisher
Springer Nature Switzerland
Reference6 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)
2. Iwasaki, Y., Hasebe, K.: Ant colony optimization for K-independent average traveling salesman problem. In: Tan, Y., Shi, Y. (eds.) ICSI 2021. LNCS, vol. 12689, pp. 333–344. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-78743-1_30
3. Lenstra, J.K., Kan, A.R.: Some simple applications of the travelling salesman problem. J. Oper. Res. Soc. 26(4), 717–733 (1975)
4. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498–516 (1973)
5. Matai, R., Singh, S.P., Mittal, M.L.: Traveling salesman problem: An overview of applications, formulations, and solution approaches. In: Traveling Salesman Problem, Theory and Applications. InTechOpen, London (2010)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献