HCP APPROACHES

Our approaches to solving HCP are split broadly into four categories:

• Deterministic algorithms
• Hamiltonian cycles and controlled Markov chains
• Structural characterisations
• Stochastic algorithms

Please click below on the individual project pages for detailed descriptions of each approach.

DETERMINISTIC ALGORITHMS

• Snakes and Ladders Heuristic
• Determinant interior point algorithm

HAMILTONIAN CYCLES AND CONTROLLED MARKOV CHAINS

• Variance of first hitting times
• Linear feasibility models

STRUCTURAL CHARACTERISATIONS

• Genetic theory of cubic graphs
• Fractal-like structure of cubic graphs

STOCHASTIC ALGORITHMS

• Branch-and-fix method
• Random walk approach
• Cross-entropy/optimisation hybrid approach
• Wedged-MIP heuristic