Luc Libralesso

20 papers A* 2A 2Journal 15
YearRankTypeTitle / Venue / Authors
2024 J jnl
Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization.
Ann. Oper. Res.
Khadija Hadj Salem, Luc Libralesso, Vincent Jost, Florian Fontan, Frédéric Maffray
2023 J jnl
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring.
CoRR
Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng
2023 J jnl
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring.
ACM J. Exp. Algorithmics
Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng
2022 J jnl
Iterative beam search algorithms for the permutation flowshop.
Eur. J. Oper. Res.
Luc Libralesso, Pablo Andres Focke, Aurélien Secardin, Vincent Jost
2022 A* conf
Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge).
SoCG
Florian Fontan, Pascal Lafourcade, Luc Libralesso, Benjamin Momège
2022 J jnl
Minimizing makespan under data prefetching constraints for embedded vision systems: a study of optimization methods and their performance.
Oper. Res.
Khadija Hadj Salem, Vincent Jost, Yann Kieffer, Luc Libralesso, Stéphane Mancini
2022 J jnl
Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle.
Inf. Comput.
Léo Robert, Daiki Miyahara, Pascal Lafourcade, Luc Libralesso, Takaaki Mizuki
2022 J jnl
Shadoks Approach to Low-Makespan Coordinated Motion Planning.
ACM J. Exp. Algorithmics
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
2021 J jnl
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem.
Eur. J. Oper. Res.
Luc Libralesso, Florian Fontan
2021 A conf
Automatic Generation of Declarative Models For Differential Cryptanalysis.
CP
Luc Libralesso, François Delobel, Pascal Lafourcade, Christine Solnon
2021 A* conf
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge).
SoCG
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
2021 J jnl
Shadoks Approach to Low-Makespan Coordinated Motion Planning.
CoRR
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
2020 J jnl
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem.
CoRR
Luc Libralesso, Florian Fontan
2020 — —
Anytime tree search for combinatorial optimization. (Recherches arborescentes anytime pour l'optimisation combinatoire).
Luc Libralesso
2020 J jnl
Iterative beam search algorithms for the permutation flowshop.
CoRR
Luc Libralesso, Pablo Andres Focke, Aurélien Secardin, Vincent Jost
2020 J jnl
PackingSolver: a solver for Packing Problems.
CoRR
Florian Fontan, Luc Libralesso
2020 A conf
Tree Search for the Sequential Ordering Problem.
ECAI
Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost
2019 J jnl
Do balanced words have a short period?
Theor. Comput. Sci.
Nadia Brauner, Yves Crama, Etienne Delaporte, Vincent Jost, Luc Libralesso
2019 J jnl
Tree search algorithms for the Sequential Ordering Problem.
CoRR
Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost
2012 J jnl
Low temperature direct bonding: An attractive technique for heterostructures build-up.
Microelectron. Reliab.
H. Moriceau, F. Rieutord, Frank Fournel, Léa Di Cioccio, C. Moulet, Luc Libralesso, Pierric Gueguen, Rachid Taibi, C. Deguet