The FHCP is a team project that aims to exploit novel stochastic and deterministic techniques to (i) explain the underlying theoretical difficulty of the HCP, (ii) characterise classes of graphs that are particularly hard to solve and (iii) produce world-class algorithms that enable the efficient solution of most instance of the problem on graphs not exceeding 5000 vertices... Based at Flinders University, South Australia, FHCP is led by Jerzy Filar and Vladimir Ejov. The team includes Flinders University students, research fellows and eminent national and international collaborators. FHCP team members have developed numerous approaches to analysing and solving the Hamiltonian cycle problem. A summary of these approaches is given below, with the most recent ideas listed first... Such a cycle is called a Hamiltonian cycle. The HCP has become a challenge that attracts mathematical minds both in its own right and because of its close relationship to the famous Travelling salesman..
Also known as: Flinders Hamiltonian Cycle Project