"A multi-start local search algorithm for the Hamiltonian completion ..."

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker (2020)

> Home

Details and statistics

DOI: 10.1007/S10732-020-09447-9

access: closed

type: Journal Article

metadata version: 2020-09-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/heuristics/JookenLC20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/heuristics/JookenLC20
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.