2

How many clues to give? A bilevel formulation for the minimum Sudoku clue problem
Gennesaret Tjusila, Mathieu Besançon, Mark Turner, Thorsten Koch
Cite arXiv
Robust bilevel optimization for near-optimal lower-level solutions
Mathieu Besançon, Miguel F Anjos, Luce Brotcorne
Cite arXiv
Scalable Frank--Wolfe on Generalized Self-Concordant Functions via Simple Steps
Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta
Cite
Enabling research through the SCIP optimization suite 8.0
Ksenia Bestuzheva, Mathieu Besançon, Wei-Kun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros Gleixner, others
Cite
Flexible Differentiable Optimization via Model Transformations
Akshay Sharma, Mathieu Besançon, Joaquim Dias Garcia, Benoı̂t Legat
Cite
Improved local models and new Bell inequalities via Frank-Wolfe algorithms
Sébastien Designolle, Gabriele Iommazzo, Mathieu Besançon, Sebastian Knebel, Patrick Gelß, Sebastian Pokutta
Cite DOI URL
The MIP Workshop 2023 Computational Competition on Reoptimization
Suresh Bolusani, Mathieu Besançon, Ambros Gleixner, Timo Berthold, Claudia D'Ambrosio, Gonzalo Muñoz, Joseph Paat, Dimitri Thomopulos
Cite arXiv
FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients
Mathieu Besançon, Alejandro Carderera, Sebastian Pokutta
Cite
Interrogating the effect of enzyme kinetics on metabolism using differentiable constraint-based models
St Elmo Wilken, Mathieu Besançon, Miroslav Kratochvïl, Chilperic Armel Foko Kuate, Christophe Trefois, Wei Gu, Oliver Ebenhöh
Cite arXiv
Complexity of near-optimal robust versions of multilevel optimization problems
Mathieu Besançon, Miguel F Anjos, Luce Brotcorne
Cite