1 citations · 2 across the 2 of their papers we have counts for
3 papers
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
Decades of research on the 0-1 knapsack problem led to very efficient algorithms that are able to quickly solve large problem instances to optimality. This prompted researchers to…
Few hamiltonian cycles in graphs with one or two vertex degrees
Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo +2
We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct…
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…