Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem
Data Structures and Algorithms
2017-05-22 v1
Abstract
We describe a hybrid procedure for solving the traveling salesman problem (TSP) to provable optimality. We first sparsify the instance, and then use a hybrid algorithm that combines a branch-and-cut TSP solver with a Hamiltonian cycle problem solver. We demonstrate that this procedure enables us to solve difficult instances to optimality, including one which had remained unsolved since its construction in 2002.
Keywords
Cite
@article{arxiv.1705.06855,
title = {Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem},
author = {Vladimir Ejov and Michael Haythorpe and Serguei Rossomakhine},
journal= {arXiv preprint arXiv:1705.06855},
year = {2017}
}
Comments
4 pages