A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker

This paper proposes a local search algorithm for a specific combinatorial optimisation problem in graph theory: the Hamiltonian Completion Problem (HCP) on undirected graphs. In th…