5 citations · 8 across the 5 of their papers we have counts for
6 papers
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring
Loïc Crombez, Guilherme D. da Fonseca, Florian Fontan +8
CG:SHOP is an annual geometric optimization challenge and the 2022 edition proposed the problem of coloring a certain geometric graph defined by line segments. Surprisingly, the to…
Shadoks Approach to Low-Makespan Coordinated Motion Planning
Loïc Crombez, Guilherme D. da Fonseca, Yan Gerard +3
This paper describes the heuristics used by the Shadoks team for the CG:SHOP 2021 challenge. This year's problem is to coordinate the motion of multiple robots in order to reach th…
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…
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…
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…
Tree search algorithms for the Sequential Ordering Problem
Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard +1
We present a study of several generic tree search techniques applied to the Sequential Ordering Problem. This study enables us to propose a simple and competitive tree search algor…