Certification of an optimal TSP tour through 85,900 cities
type: Item
instance of: scholarly article
title: Certification of an optimal TSP tour through 85,900 cities
zbMATH Open document ID: 1154.90601
author: David Applegate
author: Robert E. Bixby
author: Vašek Chvátal
author: William Cook
author: Daniel G. Espinoza
author: Marcos Goycoolea
author: Keld Helsgaun
published in: Operations Research Letters
publication date: 2009-02-23T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90-04
zbMATH DE Number: 5509870
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: integer programming
zbMATH Keywords: linear programming
describes a project that uses: TSPLIB
describes a project that uses: Concorde
MaRDI profile type: Publication
full work available at URL: j.orl.2008.09.006
OpenAlex ID: W2018660239
cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
cites work: Q3425132
cites work: Small Travelling Salesman Polytopes
cites work: Edmonds polytopes and weakly hamiltonian graphs
cites work: Q4234150
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: A new class of cutting planes for the symmetric travelling salesman problem
cites work: On the symmetric travelling salesman problem I: Inequalities
cites work: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
cites work: Separating a superclass of comb inequalities in planar graphs
cites work: The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
DOI: 10.1016/J.ORL.2008.09.006
description: scientific article; zbMATH DE number 5509870