Publisher
Springer Nature Switzerland
Reference7 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. Lecture Notes in Computer Science;Y Iwasaki,2021
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. Majumder, S., Singh, A.: Heuristics for K-independent total traveling salesperson problem. In: Woungang, I., Dhurandher, S.K., Pattanaik, K.K., Verma, A., Verma, P. (eds.) Advanced Network Technologies and Intelligent Computing, pp. 626–635. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-28183-9_44