Certification of an optimal TSP tour through 85, 900 cities
By David L. Applegate, Robert E. Bixby, V. Chvátal, W. Cook, Daniel G. Espinoza, M. Goycoolea, Keld Helsgaun. 2009
199 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Computer Vision and Pattern Recognition, Industrial and Manufacturing Engineering
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Vision and Pattern Recognition
In Industrial and Manufacturing Engineering
Citations in the corpus
- Learning Optimal Classification Trees: Strong Max-Flow Formulations (2020, background): “(1985), and cutting plane methods are able to find provably optimal tours to problems with tens of thousands of variables or more Applegate et al. (2009). Unfortunately, as illustrated by the following example, several of the inequalities (8.”
- Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches (2010, methodology): “The largest instance now solved optimally by Concorde arises from a VLSI application and contains 85900 vertices (Applegate et al., 2009). www.intechopen.com Traveling Salesman Problem, Theory and Applications 12 N Type Sample size Mean CPU seconds 100 500 1000 2000 2500 random random random random…”