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

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker. A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs. J. Heuristics, 26(5):743-769, 2020. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.