activity
20172022
most citedFeatures for the 0-1 knapsack problem based on inclusionwise maximal solutions

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2019

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…