18 citations · 31 across the 33 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2020★ 6 cited
Evolving test instances of the Hamiltonian completion problem
Thibault Lechien, Jorik Jooken, Patrick De Causmaecker
Predicting and comparing algorithm performance on graph instances is challenging for multiple reasons. First, there is usually no standard set of instances to benchmark performance…
cs.AI2020★ 18 cited
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Jorik Jooken, Pieter Leyman, Tony Wauters +1
In this article we propose a heuristic algorithm to explore search space trees associated with instances of combinatorial optimization problems. The algorithm is based on Monte Car…