Certification of an optimal TSP tour through 85,900 cities

Authors:
David L. Applegate;Robert E. Bixby;VašEk ChváTal;William Cook;Daniel G. Espinoza;Marcos Goycoolea;Keld Helsgaun
Affiliations:
AT&T Labs - Research, United States;Graduate School of Management, Rice University, United States;Department of Computer Science and Software Engineering, Concordia University, Canada;School of Industrial and Systems Engineering, Georgia Tech, Atlanta, GA, 30332, United States;Departamento de Ingeniería Industrial, Universidad de Chile, Chile;School of Business, Universidad Adolfo Ibáñez, Chile;Department of Computer Science, Roskilde University, Denmark
Venue:
Operations Research Letters
Year:
2009

Citing 7
Cited 9

Clique tree inequalities and the symmetric travelling salesman problem

Mathematics of Operations Research
A new class of cutting planes for the symmetric travelling salesman problem

Mathematical Programming: Series A and B
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
Small travelling salesman polytopes

Mathematics of Operations Research
Separating a Superclass of Comb Inequalities in Planar Graphs

Mathematics of Operations Research
The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation

Mathematics of Operations Research
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Use of MaSE methodology for designing a swarm-based multi-agent system

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Knowledge integration and management in autonomous systems
Finding good tours for huge Euclidean TSP instances by iterative backbone contraction

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
An effective algorithm for and phase transitions of the directed hamiltonian cycle problem

Journal of Artificial Intelligence Research
Generalized buneman pruning for inferring the most parsimonious multi-state phylogeny

RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem

INFORMS Journal on Computing
Incremental multiple-scan chain ordering for ECO flip-flop insertion

Proceedings of the International Conference on Computer-Aided Design
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics

Discrete Applied Mathematics
A backbone based TSP heuristic for large instances

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

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.