On the neutrality of two symmetric TSP solvers toward instance specification

This is a preview of subscription content, access via your institution.

References

  1. 1

    University of Waterloo. Concorde TSP solver. 2015. https://uwaterloo.ca/

  2. 2

    Lin S, Kernighan B W. An effective heuristic algorithm for the traveling-salesman problem. Oper Res, 1973, 21: 498–516

    MathSciNet  Article  Google Scholar 

  3. 3

    Neos Server. Concorde. 2019. https://neos-server.org/neos/

  4. 4

    University of Bacau. Romanian TSP instance. 2017. http://cadredidactice.ub.ro/

  5. 5

    University of Heidelberg. TSPLIB. 2018. https://www.uni-heidelberg.de/

  6. 6

    University of Waterloo. VLSI TSP datasets. 2013. https://uwaterloo.ca/

  7. 7

    Rutgers University. DIMACS generator for random TSP instances. 2013. http://archive.dimacs.rutgers.edu/

  8. 8

    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

    Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding authors

Correspondence to Gloria Cerasela Crişan or László Barna Iantovics.

Electronic supplementary material

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

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

Download citation