research
∙
04/06/2023
A computation of D(9) using FPGA Supercomputing
This preprint makes the claim of having computed the 9^th Dedekind Numbe...
share
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...
research
∙
12/16/2021
A prediction-based approach for online dynamic radiotherapy scheduling
Patient scheduling is a difficult task as it involves dealing with stoch...
research
∙
10/24/2020
Neural Networked Assisted Tree Search for the Personnel Rostering Problem
The personnel rostering problem is the problem of finding an optimal way...
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
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs
This paper proposes a local search algorithm for a specific combinatoria...
research
∙
06/13/2018
Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent
The Steiner Tree Problem (STP) in graphs is an important problem with va...
research
∙
09/02/2016
A MIP Backend for the IDP System
The IDP knowledge base system currently uses MiniSAT(ID) as its backend ...
research
∙
03/12/2016