Compressed files (tar and zip) containing Makefile and C programs for the Match and Timedmatch benchmark codes and for generators of the 12 types of random instances covered in the Cirasella, et al paper listed below. The tar and zipfiles also contain a README file with more information, a file that lists the commands for generating all the randomly generated instances in the testbed, samples of the outputs of all 12 generators, a file containing the Held-Karp bounds for all the instances in the testbeds, and a file containing the optimal tour lengths where known. (tarfile, zipfile ).

Compressed files (zip and tar) containing the real-world benchmark instances from TSPLIB and elsewhere covered in the above paper. The tar and zipfiles also include is the C code for converting these to TSPLIB format, and files containing the Held-Karp bonds and optimal tour lengths. Note that, even when compressed, both files are slightly bigger than 6 megabytes and so may take some time to download. (tarfile, zipfile ).

• J. Cirasella, D.S. Johnson, L.A. McGeoch, and W. Zhang, ``The asymmetric traveling salesman problem: Algorithms, instance generators, and tests,'' in Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Lecture Notes in Computer Science, Vol. 2153, Springer, Berlin, 2001, 32-59 (28 pages postscript). (PDF). This is the paper that introduced the above generators and realworld testbeds

• D.S. Johnson, G. Gutin, L.A. McGeoch, A. Yeo, W. Zhang, and A. Zverovich, ``Experimental Analysis of Heuristics for the ATSP,'' in The Traveling Salesman Problem and Its Variations , G. Gutin and A. Punnen, editors, Kluwer Academic Publishers, Boston, 2002, 445-487. (45 pages postscript, near final draft) (PDF).