Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

On the neutrality of two symmetric TSP solvers toward instance specification

This is a preview of subscription content, log in to check access.


  1. 1

    University of Waterloo. Concorde TSP solver. 2015.

  2. 2

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

  3. 3

    Neos Server. Concorde. 2019.

  4. 4

    University of Bacau. Romanian TSP instance. 2017.

  5. 5

    University of Heidelberg. TSPLIB. 2018.

  6. 6

    University of Waterloo. VLSI TSP datasets. 2013.

  7. 7

    Rutgers University. DIMACS generator for random TSP instances. 2013.

  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

Download references

Author information

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).

Download citation