Universally Hard Hamiltonian Cycle Problem Instances
(2022)
Presentation / Conference Contribution
Sleegers, J., Thomson, S. L., & van den Berg, D. (2022, November). Universally Hard Hamiltonian Cycle Problem Instances. Presented at ECTA 2022 : 14th International Conference on Evolutionary Computation Theory and Applications, Valletta, Malta
In 2021, evolutionary algorithms found the hardest-known yes and no instances for the Hamiltonian cycle problem. These instances, which show regularity patterns, require a very high number of recursions for the best exact backtracking algorithm (Vand... Read More about Universally Hard Hamiltonian Cycle Problem Instances.