1 citations · 1 across the 2 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2020
An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems
Florian Fontan, Luc Libralesso
[libralesso_anytime_2020] proposed an anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (https://www.roadef.org/challenge/2018/en/index.php). T…
cs.AI2020
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
Luc Libralesso, Florian Fontan
In this article, we present the anytime tree search algorithm we designed for the 2018 ROADEF/EURO challenge glass cutting problem proposed by the French company Saint-Gobain. The…