Publications

Suresh Bolusani, Mathieu Besançon, Ksenia Bestuzheva, Antonia Chmiela, João Dionísio, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Mohammed Ghannam, Ambros Gleixner, Christoph Graczyk, Katrin Halbig, Ivo Hedtke, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Dominik Kamp, Thorsten Koch, Kevin Kofler, Jurgen Lentz, Julian Manns, Gioni Mexi, Erik Mühmer, Marc E. Pfetsch, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Mark Turner, Stefan Vigerske, Dieter Weninger, Lixing Xu (2024). The SCIP Optimization Suite 9.0.

Cite arXiv URL

Elias Wirth, Mathieu Besançon, Sebastian Pokutta (2024). The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control.

Cite arXiv URL

Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta (2024). Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods. 22nd International Symposium on Experimental Algorithms (SEA 2024).

Cite DOI URL

Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta (2024). Scalable Frank--Wolfe on Generalized Self-Concordant Functions via Simple Steps. SIAM Journal on Optimization.

Cite

Mathieu Besançon, Miguel F Anjos, Luce Brotcorne (2024). Robust bilevel optimization for near-optimal lower-level solutions. Journal of Global Optimization.

Cite arXiv

Gioni Mexi, Somayeh Shamsi, Mathieu Besançon, Pierre Le Bodic (2024). Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model. International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research.

Cite arXiv

Yohann Chasseray, Mathieu Besançon, Éva Petitdemange, Xavier Lorca (2024). Optimisation models for the design of multiple self-consumption loops in semi-rural areas.

Cite arXiv

Kartikey Sharma, Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta (2024). Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe. Proceedings of the INFORMS Optimization Society Annual conference.

Cite arXiv

Gennesaret Tjusila, Mathieu Besançon, Mark Turner, Thorsten Koch (2024). How many clues to give? A bilevel formulation for the minimum Sudoku clue problem. Operations Research Letters.

Cite arXiv

Suresh Bolusani, Gioni Mexi, Mathieu Besançon, Mark Turner (2024). A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP.

Cite arXiv URL

Suresh Bolusani, Mathieu Besançon, Ambros Gleixner, Timo Berthold, Claudia D'Ambrosio, Gonzalo Muñoz, Joseph Paat, Dimitri Thomopulos (2023). The MIP Workshop 2023 Computational Competition on Reoptimization. Mathematical Programming Computation.

Cite arXiv

Gioni Mexi, Mathieu Besançon, Suresh Bolusani, Antonia Chmiela, Ambros Gleixner, Alexander Hoen (2023). Scylla: a matrix-free fix-propagate-and-project heuristic for mixed-integer optimization. Operations Research Proceedings.

Cite arXiv

Sébastien Designolle, Gabriele Iommazzo, Mathieu Besançon, Sebastian Knebel, Patrick Gelß, Sebastian Pokutta (2023). Improved local models and new Bell inequalities via Frank-Wolfe algorithms. Phys. Rev. Res..

Cite DOI URL

Akshay Sharma, Mathieu Besançon, Joaquim Dias Garcia, Benoı̂t Legat (2023). Flexible Differentiable Optimization via Model Transformations. INFORMS Journal on Computing.

Cite

Ksenia Bestuzheva, Mathieu Besançon, Wei-Kun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros Gleixner, others (2023). Enabling research through the SCIP optimization suite 8.0. ACM Transactions on Mathematical Software.

Cite

Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch (2023). Cutting plane selection with analytic centers and multiregression. International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research.

Cite

Mark Turner, Timo Berthold, Mathieu Besançon (2023). A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming. Operations Research Proceedings.

Cite arXiv

St Elmo Wilken, Mathieu Besançon, Miroslav Kratochvïl, Chilperic Armel Foko Kuate, Christophe Trefois, Wei Gu, Oliver Ebenhöh (2022). Interrogating the effect of enzyme kinetics on metabolism using differentiable constraint-based models. Metabolic Engineering.

Cite arXiv

Jan Macdonald, Mathieu Besançon, Sebastian Pokutta (2022). Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings. International Conference in Machine Learning.

Cite

Mathieu Besançon, Alejandro Carderera, Sebastian Pokutta (2022). FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients. INFORMS Journal on Computing.

Cite

Deborah Hendrych, Hannah Troppens, Mathieu Besançon, Sebastian Pokutta (2022). Convex mixed-integer optimization with Frank-Wolfe algorithms.

Cite arXiv

Ksenia Bestuzheva, Mathieu Besançon, Wei-Kun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros Gleixner, others (2021). The SCIP Optimization Suite 8.0.

Cite arXiv

Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta (2021). Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions. Advances in Neural Information Processing Systems.

Cite

Mathieu Besançon, Theodore Papamarkou, David Anthoff, Alex Arslan, Simon Byrne, Dahua Lin, John Pearson (2021). Distributions.jl: Definition and Modeling of Probability Distributions in the JuliaStats Ecosystem. Journal of Statistical Software.

Cite DOI

Mathieu Besançon, Miguel F Anjos, Luce Brotcorne (2021). Complexity of near-optimal robust versions of multilevel optimization problems. Optimization Letters.

Cite

Mathieu Besançon, Miguel F Anjos, Luce Brotcorne, Juan A Gomez-Herrera (2020). A bilevel approach for optimal price-setting of time-and-level-of-use tariffs. IEEE Transactions on Smart Grid.

Cite

Mathieu Besançon (2019). A Julia package for bilevel optimization problems. Journal of Open Source Software.

Cite

Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne, Juan A. Gomez-Herrera (2019). A Bilevel Framework for Optimal Price-Setting of Time-and-Level-of-Use Tariffs.

Cite arXiv