Luc Libralesso obtained his Ph.D. in applied mathematics on anytime tree search algorithms for combinatorial optimization. He is developing algorithms to solve various combinatorial optimization problems using techniques inspired by AI planning, operations research, and meta-heuristics.