The FHCP Challenge Set is a collection of 1001 instances of the Hamiltonian Cycle Problem, ranging in size from 66 vertices up to 9528 vertices, with an average size of just over 3000 vertices. The problems are in the standard HCP format (see below). All of the instances are designed to be difficult to solve using standard HCP heuristics. Every one of the 1001 graphs is known to be Hamiltonian.
Download the FHCP Challenge Set via the Flinders University website or the University of Heidelberg’s TSPLIB website.
COMPETITION OPENS: 30TH SEPTEMBER, 2015
COMPETITION DEADLINE : 30TH SEPTEMBER, 2016
The FHCP team is offering a $1001 (US) prize for the first researcher, or team of researchers, who can provide a solution for every graph in the set. If no team is successful in solving all 1001 graphs by the competition deadline, then the team which solved the largest number of graphs will win the prize, so research teams are encouraged to submit partial sets of solutions early and often!