Mathieu Besançon

According to our database, Mathieu Besançon authored at least 22 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Robust bilevel optimization for near-optimal lower-level solutions.

Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne

J. Glob. Optim., December, 2024

The MIP Workshop 2023 Computational Competition on reoptimization.

Suresh Bolusani, Mathieu Besançon, Ambros M. Gleixner, Timo Berthold, Claudia D'Ambrosio, Gonzalo Muñoz, Joseph Paat, Dimitri Thomopulos

Math. Program. Comput., June, 2024

Scalable Frank-Wolfe on Generalized Self-Concordant Functions via Simple Steps.

Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta

SIAM J. Optim., 2024

How many clues to give? A bilevel formulation for the minimum Sudoku clue problem.

Gennesaret Tjusila, Mathieu Besançon, Mark Turner, Thorsten Koch

Oper. Res. Lett., 2024

Flexible Differentiable Optimization via Model Transformations.

Mathieu Besançon, Joaquim Dias Garcia, Benoît Legat, Akshay Sharma

INFORMS J. Comput., 2024

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP.

Suresh Bolusani, Gioni Mexi, Mathieu Besançon, Mark Turner

CoRR, 2024

Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods.

Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta

Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model.

Gioni Mexi, Somayeh Shamsi, Mathieu Besançon, Pierre Le Bodic

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2024

2023

Enabling Research through the SCIP Optimization Suite 8.0.

Ksenia Bestuzheva, Mathieu Besançon, Weikun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros M. Gleixner, Leona Gottwald, Christoph Graczyk, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco E. Lübbecke, Stephen J. Maher, Frederic Matter, Erik Mühmer, Benjamin Müller, Marc E. Pfetsch, Daniel Rehfeldt, Steffan Schlein, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Boro Sofranac, Mark Turner, Stefan Vigerske, Fabian Wegscheider, Philipp Wellner, Dieter Weninger, Jakob Witzig

ACM Trans. Math. Softw., June, 2023

A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming.

Mark Turner, Timo Berthold, Mathieu Besançon

CoRR, 2023

Scylla: a matrix-free fix-propagate-and-project heuristic for mixed-integer optimization.

Gioni Mexi, Mathieu Besançon, Suresh Bolusani, Antonia Chmiela, Alexander Hoen, Ambros M. Gleixner

CoRR, 2023

Branching via Cutting Plane Selection: Improving Hybrid Branching.

Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch

CoRR, 2023

Cutting Plane Selection with Analytic Centers and Multiregression.

Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

2022

FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients.

Mathieu Besançon, Alejandro Carderera, Sebastian Pokutta

INFORMS J. Comput., 2022

Convex integer optimization with Frank-Wolfe methods.

Deborah Hendrych, Hannah Troppens, Mathieu Besançon, Sebastian Pokutta

CoRR, 2022

Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings.

Jan MacDonald, Mathieu Besançon, Sebastian Pokutta

Proceedings of the International Conference on Machine Learning, 2022

2021

Complexity of near-optimal robust versions of multilevel optimization problems.

Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne

Optim. Lett., 2021

Distributions.jl: Definition and Modeling of Probability Distributions in the JuliaStats Ecosystem.

Mathieu Besançon, Theodore Papamarkou, David Anthoff, Alex Arslan, Simon Byrne, Dahua Lin, John Pearson

J. Stat. Softw., 2021

Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions.

Alejandro Carderera, Mathieu Besançon, Sebastian Pokutta

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

A Bilevel Approach for Optimal Price-Setting of Time-and-Level-of-Use Tariffs.

Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne, Juan A. Gómez-Herrera

IEEE Trans. Smart Grid, 2020

2019

A Julia package for bilevel optimization problems.

Mathieu Besançon

J. Open Source Softw., 2019

Near-optimal Robust Bilevel Optimization.

Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne

CoRR, 2019