6 citations · 6 across the 7 of their papers we have counts for
7 papers
A Note on Using the Resistance-Distance Matrix to solve Hamiltonian Cycle Problem
Vladimir Ejov, Jerzy A Filar, Michael Haythorpe +2
An instance of Hamiltonian cycle problem can be solved by converting it to an instance of Travelling salesman problem, assigning any choice of weights to edges of the underlying gr…
A New Heuristic for Detecting Non-Hamiltonicity in Cubic Graphs
Jerzy A Filar, Michael Haythorpe, Serguei Rossomakhine
We analyse a polyhedron which contains the convex hull of all Hamiltonian cycles of a given undirected connected cubic graph. Our constructed polyhedron is defined by polynomially-…
Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian Cycle Problem
Pouya Baniasadi, Vladimir Ejov, Jerzy A Filar +2
We present a polynomial complexity, deterministic, heuristic for solving the Hamiltonian Cycle Problem (HCP) in an undirected graph of order . Although finding a Hamiltonian cyc…
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…
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…
A Linear-size Conversion of HCP to 3HCP
Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine
We provide an algorithm that converts any instance of the Hamiltonian cycle problem (HCP) into a cubic instance of HCP (3HCP), and prove that the input size of the new instance is…