Crossmark

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

Published Online: 2020-07-01

Published Print: 2020-10

Authors

Jooken, Jorik https://orcid.org/0000-0002-5256-1921
Leyman, Pieter https://orcid.org/0000-0002-3452-0413
De Causmaecker, Patrick https://orcid.org/0000-0002-6763-1945
Funding

Funding for this research was provided by:

Fonds voor wetenschappelijk onderzoek (S007318N, 12P9419N)
License Information

Text and Data Mining valid from 2020-07-01

Version of Record valid from 2020-07-01
More Information

Article History

Received: 26 April 2019

Revised: 17 February 2020

Accepted: 21 June 2020

First Online: 1 July 2020

Document is current