6 citations · 15 across the 27 of their papers we have counts for
3 papers · 1 filter
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 construction for directed in-out subgraphs of optimal size
David Glynn, Michael Haythorpe, Asghar Moeini
We discuss the recently introduced concept of k-in-out graphs, and provide a construction for k-in-out graphs for any positive integer k. We derive a lower bound for the number of…
Change Ringing and Hamiltonian Cycles : The Search for Erin and Stedman Triples
Michael Haythorpe, Andrew Johnson
A very old problem in campanology is the search for peals. The latter can be thought of as a heavily constrained sequence of all possible permutations of a given size, where the ex…