@article{628f61a5ed5e4d74a9df14df3aaecf88,
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 = "Integer programming, Linear programming, Traveling salesman problem",
author = "Applegate, \{David L.\} and Bixby, \{Robert E.\} and Va{\v s}ek Chv{\'a}tal and William Cook and Espinoza, \{Daniel G.\} and Marcos Goycoolea and Keld Helsgaun",
note = "Funding Information: The work of W. Cook was supported by ONR Grant N00014-03-1-0040 and by NSF Grant CMMI-0726370. ",
year = "2009",
month = jan,
doi = "10.1016/j.orl.2008.09.006",
language = "English",
volume = "37",
pages = "11--15",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier B.V.",
number = "1",
}