0

Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model
Add the full text or supplementary notes for the publication here using Markdown formatting.
Gioni Mexi, Somayeh Shamsi, Mathieu Besançon, Pierre Le Bodic
Cite arXiv
Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods
Add the full text or supplementary notes for the publication here using Markdown formatting.
Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta
Cite arXiv
How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem
Add the full text or supplementary notes for the publication here using Markdown formatting.
Gennesaret Tjusila, Mathieu Besançon, Mark Turner, Thorsten Koch
Cite arXiv
Scylla: a matrix-free fix-propagate-and-project heuristic for mixed-integer optimization
Add the full text or supplementary notes for the publication here using Markdown formatting.
Gioni Mexi, Mathieu Besançon, Suresh Bolusani, Antonia Chmiela, Ambros Gleixner, Alexander Hoen
Cite arXiv
The MIP Workshop 2023 Computational Competition on Reoptimization
Add the full text or supplementary notes for the publication here using Markdown formatting.
Suresh Bolusani, Mathieu Besançon, Ambros Gleixner, Timo Berthold, Claudia D'Ambrosio, Gonzalo Muñoz, Joseph Paat, Dimitri Thomopulos
Cite arXiv
A Bilevel Framework for Optimal Price-Setting of Time-and-Level-of-Use Tariffs
Add the full text or supplementary notes for the publication here using Markdown formatting.
Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne, Juan A. Gomez-Herrera
Cite