activity
20062019
most citedA new benchmark set for Traveling salesman problem and Hamiltonian cycle problem

6 citations · 6 across the 7 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.DS2017

Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem

Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine

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 combine…