photo de profil

Mathieu Lerouge

Researcher in Operations Research

About me

Current position

I am currently an Optimization Scientist at DecisionBrain. I focus on modeling operational problems and implementing mathematical optimization solutions to meet clients' specific needs.

Previously, I was a postdoctoral fellow in Computer Science at the Dipartimento di Ingegneria dell'Energia Elettrica e dell'Informazione "Guglielmo Marconi" of the Università di Bologna. My postdoctoral work dealt with Machine-Learning-aided reoptimization methods for real-time adjustments and human interaction.

I hold a PhD in Computer Science from CentraleSupélec - Université Paris-Saclay. My PhD research aimed at developing approaches for modeling and generating explanations about the solutions stemming from optimization systems for their end-users. More specifically, it focused on providing user-centered explanations in the case of the Workforce Scheduling and Routing Problem (WSRP).

Topics of interest

  • Operations Research, Combinatorial Optimization, Mathematical Programming, Metaheuristics
  • Artificial Intelligence, Machine Learning
  • Explanations, Explainable Artificial Intelligence
  • Ethics and Operations Research, Ethics and Artificial Intelligence, Sustainability
  • Decision support system

Contact

Curriculum vitae

Research

Post-doc

  • Project title: “Machine-Learning-aided reoptimization methods for real-time adjustments.”
  • Project description: In industrial and operational contexts, optimal solutions to combinatorial optimization problems often become infeasible due to unpredictable disruptions, such as machine breakdowns. Re-solving the underlying Mixed-Integer Linear Programming (MILP) models from scratch is computationally prohibitive for real-time reactions, while simple repair heuristics typically yield poor-quality results. Furthermore, practical adjustments require operational stability, meaning the new plan should not deviate excessively from the original one. This post-doctoral research addresses these challenges by developing a novel "learning-to-reoptimize" framework. Specifically, we design a fix-and-reoptimize strategy aided by a Graph Neural Network (GNN). Given a feature graph encoding the information about the disruption and the solution before disruption, the GNN predicts the likelihood that specific binary decision variables need to be modified. This drastically reduces the MILP search space by identifying a significant subset of decision variables to hard-fix while reoptimizing the rest. Applied to the Lot Sizing Problem (LSP), numerical experiments demonstrate that this graph-based approach successfully generalizes across varying instance sizes and consistently yields good-quality solutions within short time limits.
  • Institution: Dipartimento di Ingegneria dell'Energia Elettrica e dell'Informazione "Guglielmo Marconi" (DEI), Università di Bologna (UniBo).
  • In collaboration with: DecisionBrain.
  • Supervisors: Andrea Lodi (DEI, UniBo), Enrico Malaguti (DEI, UniBo), Michele Monaci (DEI, UniBo), Filippo Focacci (DecisionBrain).
  • Date: January 2024 - December 2025.

PhD thesis

Participation to events

Awards

  • Best Paper Award Honorable for “Counterfactual Explanations for Workforce Scheduling and Routing Problems” received at the 12th International Conference on Operations Research and Enterprise Systems (ICORES) held in 2023.

Teaching

Teaching assistant at Università di Bologna

  • November 2025: Practical works (3 hours) for the Master's degree course “Network optimization”. Course content includes standard algorithms for solving network optimization problems (e.g. Prim's, Dijkstra's, Ford-Fulkerson algorithms). Master degree
  • October 2024: Lecture (3 hours) for the Master's degree course "Optimization Models and Algorithms". Course content includes MILP decomposition methods (e.g. column generation, Bender's decomposition).

Teaching assistant at CentraleSupélec - Université Paris-Saclay

  • February 2024 - March 2024: Practical works (30 hours) for the Master's degree course “Decision support: models, algorithms and programming”. Course content includes modeling of decision problems, mathematical programming, multi-objective optimization, metaheuristics and programming using Python & GUROBI.
  • February 2023 - March 2023: Supervised classes and practical works (60 hours) for the Master's degree course “Decision support: models, algorithms and programming”.
  • November 2022: Practical works (24 hours) for the Bachelor's degree courses “Coding weeks”. Course content includes Python programming, introduction to git and gitlab, team work.
  • February 2022 - March 2022: Supervised classes and practical works (60 hours) for the Master's degree course “Decision support: models, algorithms and programming”.
  • November 2021 - January 2022: Supervised classes (18 hours) for the Bachelor's degree course “Algorithmics and Complexity”. Course content includes data structures, graph algorithms, dynamic programming, computational complexity, complexity theory.
  • February 2021 - March 2021: Supervised classes and practical works (60 hours) for the Master's degree “Decision support: models, algorithms and programming”.