Summary
Luc Libralesso is an Algorithm Engineer with 11 years of experience specializing in tree search methods that blend AI planning techniques and constructive meta-heuristics to tackle discrete optimization problems like packing and transport. He has applied these approaches in industrial contexts and competitions, including EURO/ROADEF challenges and automatic microfluidic-chip design, and currently works at Alma scop after R&D roles including a PhD at G-SCOP. His toolset draws on Beam Search, Limited Discrepancy Search, Weighted A*, GRASP and Ant Colony Optimization, enabling competitive alternatives to classical meta-heuristics. Based in Grenoble, he pairs strong academic foundations from Université Grenoble Alpes and Université du Québec à Chicoutimi with hands-on engineering in production settings. Luc maintains a technical presence via his personal website and focuses on making tree search algorithms not just theoretically sound but practically deployable. An underappreciated strength is his knack for translating planning-inspired search ideas into domain-specific constructive heuristics that scale to real-world industrial instances.
11 years of coding experience
1 year of employment as a software developer
Master’s Degree, Computer Science, Master’s Degree, Computer Science at Université du Québec à Chicoutimi
Master Operations Research and Combinatorial Optimization, Computational and Applied Mathematics, M.D, Master Operations Research and Combinatorial Optimization, Computational and Applied Mathematics, M.D at Université Grenoble Alpes
Polytech'Grenoble
Computer Science, Computer Science at Université Joseph Fourier (Grenoble I)
English