activity
20172025
most citedA goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints

20 citations · 39 across the 6 of their papers we have counts for

collaborators
Showing cs.AIShow all

1 paper · 1 filter

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…