18 citations · 31 across the 33 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022★ 1 cited
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…
cs.DS2022★ 1 cited
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…