5 citations · 8 across the 5 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.AI2020
Iterative beam search algorithms for the permutation flowshop
Luc Libralesso, Pablo Andres Focke, Aurélien Secardin +1
We study an iterative beam search algorithm for the permutation flowshop (makespan and flowtime minimization). This algorithm combines branching strategies inspired by recent branc…
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…