research
∙
11/16/2022
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
Decades of research on the 0-1 knapsack problem led to very efficient al...
share
research
∙
11/15/2022
Few hamiltonian cycles in graphs with one or two vertex degrees
We fully disprove a conjecture of Haythorpe on the minimum number of ham...
research
∙
08/31/2022
A heuristic algorithm for the maximum happy vertices problem using tree decompositions
We propose a new heuristic algorithm for the Maximum Happy Vertices prob...
research
∙
10/22/2020
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
In this article, a novel approach to solve combinatorial optimization pr...
research
∙
10/05/2020
Evolving test instances of the Hamiltonian completion problem
Predicting and comparing algorithm performance on graph instances is cha...
research
∙
04/24/2019
