3

A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming
Mark Turner, Timo Berthold, Mathieu Besançon
Cite arXiv
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
Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model
Gioni Mexi, Somayeh Shamsi, Mathieu Besançon, Pierre Le Bodic
Cite arXiv
Scylla: a matrix-free fix-propagate-and-project heuristic for mixed-integer optimization
Gioni Mexi, Mathieu Besançon, Suresh Bolusani, Antonia Chmiela, Ambros Gleixner, Alexander Hoen
Cite arXiv
Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods
Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta
Cite arXiv
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
Convex mixed-integer optimization with Frank-Wolfe algorithms
Deborah Hendrych, Hannah Troppens, Mathieu Besançon, Sebastian Pokutta
Cite arXiv
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 arXiv
Near-optimal robust bilevel optimization
Mathieu Besançon, Miguel F Anjos, Luce Brotcorne
Cite arXiv