6 citations · 6 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018★ 6 cited
A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem
Pouya Baniasadi, Vladimir Ejov, Michael Haythorpe +1
We present a benchmark set for Traveling salesman problem (TSP) with characteristics that are different from the existing benchmark sets. In particular, we focus on small instances…
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…