A Cross-Entropy Approach to the Domination Problem and Its Variants von Burdett, Ryan, Haythorpe, Michael, Newcombe, Alex

Volltext

Reducing the generalised Sudoku problem to the Hamiltonian cycle problem von Haythorpe, Michael

Volltext

Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles von Haythorpe, Michael

Volltext

Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples von Haythorpe, Michael, Johnson, Andrew

Volltext

An improved binary programming formulation for the secure domination problem von Burdett, Ryan, Haythorpe, Michael

Volltext

The secure domination number of Cartesian products of small graphs with paths and cycles von Haythorpe, Michael, Newcombe, Alex

Volltext

Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem von Haythorpe, Michael, Murray, Walter

Volltext

A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem von Eshragh, Ali, Filar, Jerzy A., Haythorpe, Michael

Volltext

A cross-entropy method for optimising robotic automated storage and retrieval systems von Foumani, Mehdi, Moeini, Asghar, Haythorpe, Michael, Smith-Miles, Kate

Volltext

ON THE CROSSING NUMBER OF THE CARTESIAN PRODUCT OF A SUNLET GRAPH AND A STAR GRAPH von HAYTHORPE, MICHAEL, NEWCOMBE, ALEX

Volltext

Binary programming formulations for the upper domination problem von Burdett, Ryan, Haythorpe, Michael, Newcombe, Alex

Volltext

Variants of the domination number for flower snarks von Burdett, Ryan, Haythorpe, Michael, Newcombe, Alex

Volltext

An effective crossing minimisation heuristic based on star insertion von Clancy, Kieran, Haythorpe, Michael, Newcombe, Alex

Volltext

A new heuristic for detecting non-Hamiltonicity in cubic graphs von Filar, Jerzy A, Haythorpe, Michael, Rossomakhine, Serguei

Volltext

There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11 von Clancy, Kieran, Haythorpe, Michael, Newcombe, Alex, Pegg, Ed

Volltext

Deterministic “Snakes and Ladders” Heuristic for the Hamiltonian cycle problem von Baniasadi, Pouya, Ejov, Vladimir, Filar, Jerzy A., Haythorpe, Michael, Rossomakhine, Serguei

Volltext

Constructing Arbitrarily Large Graphs with a Specified Number of Hamiltonian Cycles von Haythorpe, Michael

Volltext bestellen

Non-Hamiltonian 3-Regular Graphs with Arbitrary Girth von Haythorpe, Michael

Volltext bestellen

FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem von Haythorpe, Michael

Volltext bestellen

Constructing Families of Cospectral Regular Graphs von Haythorpe, Michael, Newcombe, Alex

Volltext bestellen