@article{67a09ff0c2a311dc9a79000ea68e967b,
title = "Certification of an optimal TSP tour through 85,900 cities",
abstract = "We describe a computer code and data that together certify the optimality of a solution to the 85,900-city traveling salesman problem pla85900, the largest instance in the TSPLIB collection of challenge problems",
keywords = "traveling salesman problem, integer programming, linear programming",
author = "Applegate, {David L.} and Bixby, {Robert E.} and Vasek Chvatal and William Cook and Espinoza, {Daniel G.} and Marcos Goycoolea and Keld Helsgaun",
year = "2009",
doi = "10.1016/j.orl.2008.09.006",
language = "English",
volume = "37",
pages = "11--15",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier BV",
number = "1",
}