18 citations · 31 across the 33 of their papers we have counts for
3 papers · 1 filter
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 heuristic algorithm using tree decompositions for the maximum happy vertices problem
Louis Carpentier, Jorik Jooken, Jan Goedgebeur
We propose a new methodology to develop heuristic algorithms using tree decompositions. Traditionally, such algorithms construct an optimal solution of the given problem instance t…