95 citations · 203 across the 21 of their papers we have counts for
9 papers · 2 filters
Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods
Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta
We tackle the Optimal Experiment Design Problem, which consists of choosing experiments to run or observations to select from a finite set to estimate the parameters of a system. T…
Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model
Gioni Mexi, Somayeh Shamsi, Mathieu Besançon +1
Strong Branching (SB) is a cornerstone of all modern branching rules used in the Branch-and-Bound (BnB) algorithm, which is at the center of Mixed-Integer Programming solvers. In i…
The MIP Workshop 2023 Computational Competition on Reoptimization
Suresh Bolusani, Mathieu Besançon, Ambros Gleixner +5
This paper describes the computational challenge developed for a computational competition held in 2023 for the anniversary of the Mixed Integer Programming Work…
Scylla: a matrix-free fix-propagate-and-project heuristic for mixed-integer optimization
Gioni Mexi, Mathieu Besançon, Suresh Bolusani +3
We introduce Scylla, a primal heuristic for mixed-integer optimization problems. It exploits approximate solves of the Linear Programming relaxations through the matrix-free Primal…
A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming
Mark Turner, Timo Berthold, Mathieu Besançon
The current cut selection algorithm used in mixed-integer programming solvers has remained largely unchanged since its creation. In this paper, we propose a set of new cut scoring…
Branching via Cutting Plane Selection: Improving Hybrid Branching
Mark Turner, Timo Berthold, Mathieu Besançon +1
Cutting planes and branching are two of the most important algorithms for solving mixed-integer linear programs. For both algorithms, disjunctions play an important role, being use…
How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem
Gennesaret Tjusila, Mathieu Besançon, Mark Turner +1
It has been shown that any 9 by 9 Sudoku puzzle must contain at least 17 clues to have a unique solution. This paper investigates the more specific question: given a particular com…
Enabling Research through the SCIP Optimization Suite 8.0
Ksenia Bestuzheva, Mathieu Besançon, Wei-Kun Chen +32
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. The focus of…
Cutting Plane Selection with Analytic Centers and Multiregression
Mark Turner, Timo Berthold, Mathieu Besançon +1
Cutting planes are a crucial component of state-of-the-art mixed-integer programming solvers, with the choice of which subset of cuts to add being vital for solver performance. We…