Follow
Michael Haythorpe
Michael Haythorpe
Verified email at flinders.edu.au - Homepage
Title
Cited by
Cited by
Year
A cross-entropy method for optimising robotic automated storage and retrieval systems
M Foumani, A Moeini, M Haythorpe, K Smith-Miles
International Journal of Production Research 56 (19), 6450-6472, 2018
542018
Deterministic “Snakes and Ladders” Heuristic for the Hamiltonian cycle problem
P Baniasadi, V Ejov, JA Filar, M Haythorpe, S Rossomakhine
Mathematical Programming Computation 6 (1), 55-75, 2014
382014
A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem
A Eshragh, JA Filar, M Haythorpe
Annals of Operations Research 189, 103-125, 2011
342011
A survey of graphs with known or bounded crossing numbers
K Clancy, M Haythorpe, A Newcombe
Australasian Journal of Combinatorics 78 (2), 209-296, 2020
332020
FHCP challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem
M Haythorpe
Bulletin of the ICA 83, 98-107, 2018
23*2018
Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem
V Ejov, JA Filar, M Haythorpe, GT Nguyen
Mathematics of Operations Research 34 (3), 758-768, 2009
212009
Markov chain based algorithms for the hamiltonian cycle problem
M Haythorpe
University of South Australia, 2010
192010
A conjecture on the prevalence of cubic bridge graphs
J Filar, M Haythorpe, G Nguyen
Discussiones Mathematicae Graph Theory 30 (1), 175-179, 2010
152010
An effective crossing minimisation heuristic based on star insertion
K Clancy, M Haythorpe, A Newcombe
Journal of Graph Algorithms and Applications 23 (2), 135-166, 2019
132019
On the minimum number of Hamiltonian cycles in regular graphs
M Haythorpe
Experimental mathematics 27 (4), 426-430, 2018
112018
An improved binary programming formulation for the secure domination problem
R Burdett, M Haythorpe
Annals of Operations Research 295 (2), 561-573, 2020
72020
A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem
P Baniasadi, V Ejov, M Haythorpe, S Rossomakhine
arXiv preprint arXiv:1806.09285, 2018
72018
Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples
M Haythorpe, A Johnson
Electronic Journal of Graph Theory and Applications 7 (1), 61-75, 2019
62019
Linearly-growing reductions of Karp's 21 NP-complete problems
J Filar, M Haythorpe, R Taylor
Numerical Algebra, Control and Optimization 8 (1), 1-16, 2018
62018
Genetic Theory for Cubic Graphs
P Banisadi, V Ejov, J Filar, M Haythorpe
62016
Genetic theory for cubic graphs
P Baniasadi, V Ejov, JA Filar, M Haythorpe, P Baniasadi, V Ejov, JA Filar, ...
Genetic Theory for Cubic Graphs, 1-26, 2016
62016
A linear-size conversion of HCP to 3HCP
V Ejov, M Haythorpe, S Rossomakhine
Australasian Journal of Combinatorics 62 (1), 45-58, 2015
62015
On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph
JA Filar, M Haythorpe, W Murray
Journal of Global Optimization 56, 1425-1440, 2013
62013
Finding Hamiltonian cycles using an interior point method
M Haythorpe
Australian Mathematical Society, 2010
62010
An Effective Crossing Minimisation Heuristic Based on Star Insertion
M Haythorpe, A Newcombe
Submitted to J. Graph Algorithms and Applications. http://arxiv. org/abs …, 0
6
The system can't perform the operation now. Try again later.
Articles 1–20