Michael Haythorpe

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 27

Top Topics

Hamiltonian Cycle

Algorithmic Approaches

Storage And Retrieval

Traveling Salesman

Top Venues

Australas. J Comb.

Ann. Oper. Res.

Electron. J. Graph Theory Appl.

Publications

Ryan Burdett, Michael Haythorpe, Alex Newcombe
Binary programming formulations for the upper domination problem. Math. Methods Oper. Res. 98 (2) (2023)
Michael Haythorpe, Alex Newcombe
The secure domination number of Cartesian products of small graphs with paths and cycles. Discret. Appl. Math. 309 (2022)
Michael Haythorpe, Walter Murray
Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem. Comput. Optim. Appl. 81 (1) (2022)
Ryan Burdett, Michael Haythorpe, Alex Newcombe
Binary Programming Formulations for the Upper Domination Problem. CoRR (2021)
Michael Haythorpe, Alex Newcombe
Constructing families of cospectral regular graphs. Comb. Probab. Comput. 29 (5) (2020)
Ryan Burdett, Michael Haythorpe
An improved binary programming formulation for the secure domination problem. Ann. Oper. Res. 295 (2) (2020)
Kieran Clancy, Michael Haythorpe, Alex Newcombe, Ed Pegg
There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11. Graphs Comb. 36 (6) (2020)
Kieran Clancy, Michael Haythorpe, Alex Newcombe
A survey of graphs with known or bounded crossing numbers. Australas. J Comb. 78 (2020)
Michael Haythorpe, Jerzy A. Filar
A Linearly-growing Conversion from the Set Splitting Problem to the Directed Hamiltonian Cycle Problem. CoRR (2019)
Ryan Burdett, Michael Haythorpe
An improved binary programming formulation for the secure domination problem. CoRR (2019)
Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine
Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian Cycle Problem. CoRR (2019)
Kieran Clancy, Michael Haythorpe, Alex Newcombe
An effective crossing minimisation heuristic based on star insertion. J. Graph Algorithms Appl. 23 (2) (2019)
Michael Haythorpe, Andrew Johnson
Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples. Electron. J. Graph Theory Appl. 7 (1) (2019)
Jerzy A. Filar, Michael Haythorpe, Richard Taylor
Linearly-growing Reductions of Karp's 21 NP-complete Problems. CoRR (2019)
Michael Haythorpe
FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem. CoRR (2019)
Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, John F. Roddick, Serguei Rossomakhine
A note on using the resistance-distance matrix to solve Hamiltonian cycle problem. Ann. Oper. Res. 261 (1-2) (2018)
Michael Haythorpe
On the Minimum Number of Hamiltonian Cycles in Regular Graphs. Exp. Math. 27 (4) (2018)
Kieran Clancy, Michael Haythorpe, Alex Newcombe
An effective crossing minimisation heuristic based on star insertion. CoRR (2018)
Michael Haythorpe
FHCP challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem. Bull. ICA 83 (2018)
Mehdi Foumani, Asghar Moeini, Michael Haythorpe, Kate Smith-Miles
A cross-entropy method for optimising robotic automated storage and retrieval systems. Int. J. Prod. Res. 56 (19) (2018)
Pouya Baniasadi, Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine
A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem. CoRR (2018)
Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine
Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem. CoRR (2017)
Michael Haythorpe
Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles. Electron. J. Graph Theory Appl. 4 (1) (2016)
Michael Haythorpe
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem. AKCE Int. J. Graphs Comb. 13 (3) (2016)
Michael Haythorpe
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem. CoRR (2016)
Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine
A linear-size conversion of HCP to 3HCP. Australas. J Comb. 62 (2015)
Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine
A new heuristic for detecting non-Hamiltonicity in cubic graphs. Comput. Oper. Res. 64 (2015)
Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine
Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian cycle problem. Math. Program. Comput. 6 (1) (2014)
Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine
A Linear-size Conversion of HCP to 3HCP CoRR (2013)
Jerzy A. Filar, Michael Haythorpe, Walter Murray
On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph. J. Glob. Optim. 56 (4) (2013)
Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe
Genetic Theory for Cubic Graphs CoRR (2012)
Ali Eshragh, Jerzy A. Filar, Michael Haythorpe
A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem. Ann. Oper. Res. 189 (1) (2011)
Jerzy A. Filar, Michael Haythorpe, Giang T. Nguyen
A conjecture on the prevalence of cubic bridge graphs. Discuss. Math. Graph Theory 30 (1) (2010)
Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Giang T. Nguyen
Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem. Math. Oper. Res. 34 (3) (2009)