Sign in
Home
FHCP Challenge Set
HCP APPROACHES
Snakes and Ladders Heuristic
Determinant interior point algorithm
Variance of first hitting times
Linear feasibility models
Genetic theory of cubic graphs
Fractal-like structure of cubic graphs
Branch-and-fix approach
Random walk approach
Cross-entropy/optimisation hybrid approach
Wedged-MIP heuristic
TSP and HCP Benchmark Set
QuickCross – Crossing Number Problem
Graph Database
Properties for Cubic Graphs
People
Publications
FHCP Dissertations
SLHWeb Interface
Conversions to HCP
Contact us
Sign in
Welcome!
Log into your account
your username
your password
Forgot your password?
Password recovery
Recover your password
your email
Search
Sign in / Join
Sign in
Welcome! Log into your account
your username
your password
Forgot your password? Get help
Password recovery
Recover your password
your email
A password will be e-mailed to you.
Flinders Hamiltonian Cycle Project
(FHCP)
Home
FHCP Challenge Set
HCP APPROACHES
Snakes and Ladders Heuristic
Determinant interior point algorithm
Variance of first hitting times
Linear feasibility models
Genetic theory of cubic graphs
Fractal-like structure of cubic graphs
Branch-and-fix approach
Random walk approach
Cross-entropy/optimisation hybrid approach
Wedged-MIP heuristic
TSP and HCP Benchmark Set
QuickCross – Crossing Number Problem
Graph Database
Properties for Cubic Graphs
People
Publications
FHCP Dissertations
SLHWeb Interface
Conversions to HCP
Contact us
Contact us
We welcome any comments, suggestions or queries.
For any inquiries:
Contact
Michael Haythorpe
.
