Pierre Fouilhoux

Pierre Fouilhoux is a Full Professor in Computer Science and Discrete Mathematics at Sorbonne Paris Nord University (formerly Paris 13 University), affiliated with the LIPN Laboratory and the Algorithmics and Combinatorial Optimization (AOC) Team. He previously held a position at Sorbonne Université's LIP6 Laboratory. His research focuses on Combinatorial Optimization, Mathematical Programming, Polyhedral Approaches, and Operational Research, with contributions to scheduling, network design, and robust optimization.

Education:

• PhD in Computer Science (2004): Université Blaise Pascal, Clermont-Ferrand.
• Habilitation à Diriger des Recherches (HDR, 2018): Sorbonne Université.
• DEA in Computer Science and Operational Research, License and Master in Computer Science, and Mathematics License.

Research Interests: His work addresses polyhedral structures, exact algorithms, and combinatorial optimization problems such as scheduling, unit commitment, and network reliability. He has developed Branch-and-Cut methods and symmetry-breaking techniques for integer programming.

Publications: Over 30 peer-reviewed articles in journals like European Journal of Operational Research, Mathematical Programming, and Discrete Applied Mathematics. Recent work includes anchor-robust scheduling, unit commitment polytopes, and orbitopal fixing.

Awards: 2006 Grand Prize for Young Researcher from Clermont-Ferrand for his contributions to science popularization and research communication.

Teaching: Courses on Operations Research, Combinatorial Optimization, and Linear Programming at Sorbonne University and SUP Galilée. Supervised over 20 graduate and doctoral students, including topics like multi-objective optimization and virtual network embedding.

Labs/Teams: Active in the AOC Team at LIPN, GDR-RO research group, and ISCO conferences. Collaborates with institutions like EDF R&D and Colt-Telecom on applied optimization problems.