References
University of Waterloo. Concorde TSP solver. 2015. https://uwaterloo.ca/
Lin S, Kernighan B W. An effective heuristic algorithm for the traveling-salesman problem. Oper Res, 1973, 21: 498–516
Neos Server. Concorde. 2019. https://neos-server.org/neos/
University of Bacau. Romanian TSP instance. 2017. http://cadredidactice.ub.ro/
University of Heidelberg. TSPLIB. 2018. https://www.uni-heidelberg.de/
University of Waterloo. VLSI TSP datasets. 2013. https://uwaterloo.ca/
Rutgers University. DIMACS generator for random TSP instances. 2013. http://archive.dimacs.rutgers.edu/
Mu Z, Dubois-Lacoste J, Hoos H H, et al. On the empirical scaling of running time for finding optimal solutions to the TSP. J Heuristics, 2018, 6: 879–898
Author information
Authors and Affiliations
Corresponding authors
Electronic supplementary material
Rights and permissions
About this article
Cite this article
Crişan, G.C., Iantovics, L.B. & Kovács, L. On the neutrality of two symmetric TSP solvers toward instance specification. Sci. China Inf. Sci. 62, 219103 (2019). https://doi.org/10.1007/s11432-018-9829-5
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-018-9829-5