Mathieu Besançon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mathieu Besançon has a total of 120 co-authors. Here are the top co-authors by number of shared publications:
- Mark Turner
Zuse Institute Berlin
11 shared publications - Sebastian Pokutta
Zuse Institute Berlin
10 shared publications - Thorsten Koch
Technische Universität Berlin
7 shared publications - Ambros Gleixner
Zuse Institute Berlin Takustr. 7 14195 Berlin Germany
6 shared publications - Gioni Mexi
Zuse Institute Berlin
6 shared publications - Alexander Hoen
Zuse Institute Berlin, 14195 Berlin, Germany
5 shared publications
Latest Publications
- Open Access
- 27 October 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (4) , 049001
Erratum: Improved local models and new Bell inequalities via Frank-Wolfe algorithms [Phys. Rev. Research 5 , 043059 (2023)]
Phys. Rev. Research 8, 049001 (2026)
- 27 October 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (4) , 049001
Open AccessErratum: Improved local models and new Bell inequalities via Frank-Wolfe algorithms [Phys. Rev. Research 5 , 043059 (2023)]
Phys. Rev. Research 8, 049001 (2026)
- 2 September 2026
- Published by Springer Nature in Annals of Operations Research
- Vol. 365 (2-3) , 443-477
Optimisation models for the design of multiple self-consumption loops in semi-rural areas
- 2 September 2026
- Published by Springer Nature in Annals of Operations Research
- Vol. 365 (2-3) , 443-477
Optimisation models for the design of multiple self-consumption loops in semi-rural areas
- 1 June 2026
- Published by Springer Nature
- p. 614-630
Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods
- 1 June 2026
- Published by Springer Nature
- p. 614-630
Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods
- 6 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Bilevel models for demand response in smart grids
Modèles biniveaux pour la réponse de la demande dans les réseaux électriques intelligents: Cette thèse étudie l'optimisation bi-niveau, certaines variantes et une application à la tarification dans les réseaux électriques intelligents.Les problèmes d'optimisation bi-niveaux sont une sous-catégorie de problèmes d'optimisation mathématique contrainte où un deuxième problème ou deuxième niveau estprésent dans les contraintes.Nous étudions leur application à un tariff variable en temps et en niveau de consommation, permettant à un fournisseur d'énergie d'exploiter la flexibilité de consommateurs par des incitations économiques.Une généralisation des problèmes bi-niveaux est également proposée, dans laquelle le deuxième niveau peut sélectionner une solution qui n'est pas optimale contrairement au modèle bi-niveau classique mais quasi-optimale.Résoudre cette variante de problèmes bi-niveaux demande l'anticipation de cette déviation de la solution de deuxième niveau de l'optimalité et garantit qu'une solution au problème bi-niveau sera réalisable malgré cette déviation.
- 6 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Bilevel models for demand response in smart grids
Modèles biniveaux pour la réponse de la demande dans les réseaux électriques intelligents: Cette thèse étudie l'optimisation bi-niveau, certaines variantes et une application à la tarification dans les réseaux électriques intelligents.Les problèmes d'optimisation bi-niveaux sont une sous-catégorie de problèmes d'optimisation mathématique contrainte où un deuxième problème ou deuxième niveau estprésent dans les contraintes.Nous étudions leur application à un tariff variable en temps et en niveau de consommation, permettant à un fournisseur d'énergie d'exploiter la flexibilité de consommateurs par des incitations économiques.Une généralisation des problèmes bi-niveaux est également proposée, dans laquelle le deuxième niveau peut sélectionner une solution qui n'est pas optimale contrairement au modèle bi-niveau classique mais quasi-optimale.Résoudre cette variante de problèmes bi-niveaux demande l'anticipation de cette déviation de la solution de deuxième niveau de l'optimalité et garantit qu'une solution au problème bi-niveau sera réalisable malgré cette déviation.
- Open Access
- 12 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 51 (4) , 1-33
Improved Algorithms and Novel Applications of the FrankWolfe.jl Library
Frank-Wolfe (FW) algorithms have emerged as an essential class of methods for constrained optimization, especially on large-scale problems. In this article, we summarize the algorithmic design choices and progress made in the last years of the development of FrankWolfe.jl, a Julia package gathering high-performance implementations of state-of-the-art FW variants. We review key use cases of the library in the recent literature, which match its original dual purpose: first, becoming the de-facto toolbox for practitioners applying FW methods to their problem, and second, offering a modular ecosystem to algorithm designers who experiment with their own variants and implementations of algorithmic blocks. Finally, we demonstrate the performance of several FW variants on important problem classes in several experiments, which we curated in a separate repository for continuous benchmarking.
- 12 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 51 (4) , 1-33
Open AccessImproved Algorithms and Novel Applications of the FrankWolfe.jl Library
Frank-Wolfe (FW) algorithms have emerged as an essential class of methods for constrained optimization, especially on large-scale problems. In this article, we summarize the algorithmic design choices and progress made in the last years of the development of FrankWolfe.jl, a Julia package gathering high-performance implementations of state-of-the-art FW variants. We review key use cases of the library in the recent literature, which match its original dual purpose: first, becoming the de-facto toolbox for practitioners applying FW methods to their problem, and second, offering a modular ecosystem to algorithm designers who experiment with their own variants and implementations of algorithmic blocks. Finally, we demonstrate the performance of several FW variants on important problem classes in several experiments, which we curated in a separate repository for continuous benchmarking.
- Open Access
The SCIP Optimization Suite 10.0
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This report discusses the enhancements and extensions included in SCIP Optimization Suite 10.0. The updates in SCIP 10.0 include a new solving mode for exactly solving rational mixed-integer linear programs, a new presolver for detecting implied integral variables, a novel cut-based conflict analysis and separator for flower inequalities, two new heuristics, a novel tool for explaining infeasibility, a new interface for nonlinear solvers as well as improvements in symmetry handling, branching strategies, and SCIP's Benders' decomposition framework. SCIP Optimization Suite 10.0 also includes new and improved features in the the presolving library PaPILO, the parallel framework UG, and the decomposition framework GCG. Moreover, the SCIP Optimization Suite 10.0 contains MIP-DD, the first open-source delta debugger for mixed-integer programming solvers. These additions and enhancements have resulted in an overall performance improvement of SCIP in terms of solving time, number of nodes in the branch-and-bound tree, as well as the reliability of the solver.
Open AccessThe SCIP Optimization Suite 10.0
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This report discusses the enhancements and extensions included in SCIP Optimization Suite 10.0. The updates in SCIP 10.0 include a new solving mode for exactly solving rational mixed-integer linear programs, a new presolver for detecting implied integral variables, a novel cut-based conflict analysis and separator for flower inequalities, two new heuristics, a novel tool for explaining infeasibility, a new interface for nonlinear solvers as well as improvements in symmetry handling, branching strategies, and SCIP's Benders' decomposition framework. SCIP Optimization Suite 10.0 also includes new and improved features in the the presolving library PaPILO, the parallel framework UG, and the decomposition framework GCG. Moreover, the SCIP Optimization Suite 10.0 contains MIP-DD, the first open-source delta debugger for mixed-integer programming solvers. These additions and enhancements have resulted in an overall performance improvement of SCIP in terms of solving time, number of nodes in the branch-and-bound tree, as well as the reliability of the solver.
- Open Access
- 21 October 2025
- Published by IOS Press
- p. 2610-2617
Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly
Decomposing a flow on a Directed Acyclic Graph (DAG) into a weighted sum of a small number of paths is an essential task in operations research and bioinformatics. This problem, referred to as Sparse Flow Decomposition (SFD), has gained significant interest, in particular for its application in RNA transcript multi-assembly, the identification of the multiple transcripts corresponding to a given gene and their relative abundance. Several recent approaches cast SFD variants as integer optimization problems, motivated by the NP-hardness of the formulations they consider. We propose an alternative formulation of SFD as a data fitting problem on the conic hull of the flow polytope. By reformulating the problem on the flow polytope for compactness and solving it using specific variants of the Frank-Wolfe algorithm, we obtain a method converging rapidly to the minimizer of the chosen loss function while producing a parsimonious decomposition. Our approach subsumes previous formulations of SFD with exact and inexact flows and can model different priors on the error distributions. Computational experiments show that our method outperforms recent integer optimization approaches in runtime, but is also highly competitive in terms of reconstruction of the underlying transcripts, despite not explicitly minimizing the solution cardinality.
- 21 October 2025
- Published by IOS Press
- p. 2610-2617
Open AccessEfficient Sparse Flow Decomposition Methods for RNA Multi-Assembly
Decomposing a flow on a Directed Acyclic Graph (DAG) into a weighted sum of a small number of paths is an essential task in operations research and bioinformatics. This problem, referred to as Sparse Flow Decomposition (SFD), has gained significant interest, in particular for its application in RNA transcript multi-assembly, the identification of the multiple transcripts corresponding to a given gene and their relative abundance. Several recent approaches cast SFD variants as integer optimization problems, motivated by the NP-hardness of the formulations they consider. We propose an alternative formulation of SFD as a data fitting problem on the conic hull of the flow polytope. By reformulating the problem on the flow polytope for compactness and solving it using specific variants of the Frank-Wolfe algorithm, we obtain a method converging rapidly to the minimizer of the chosen loss function while producing a parsimonious decomposition. Our approach subsumes previous formulations of SFD with exact and inexact flows and can model different priors on the error distributions. Computational experiments show that our method outperforms recent integer optimization approaches in runtime, but is also highly competitive in terms of reconstruction of the underlying transcripts, despite not explicitly minimizing the solution cardinality.
- 12 August 2025
- Published by Springer Nature
- p. 421-427
A Multi-reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
- 12 August 2025
- Published by Springer Nature
- p. 421-427
A Multi-reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
- 23 July 2025
- Published by Springer Nature
- p. 65-72
Scylla: A Matrix-Free Fix-Propagate-and-Project Heuristic for Mixed-Integer Optimization
- 23 July 2025
- Published by Springer Nature
- p. 65-72
Scylla: A Matrix-Free Fix-Propagate-and-Project Heuristic for Mixed-Integer Optimization
- 23 July 2025
- Published by Springer Nature
- p. 217-224
A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming
- 23 July 2025
- Published by Springer Nature
- p. 217-224
A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming