1 citations · 1 across the 4 of their papers we have counts for
4 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…
Innovative ideas for teaching supports: Application to Graph theory
Nicolas Catusse, Hadrien Cambazard, Nadia Brauner +2
Teaching graph theory with the most adequate tools requires time and ideas. We present how an open community of teachers shares contents and ideas on an innovative platform. The ob…
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…