67 citations · 79 across the 4 of their papers we have counts for
7 papers · 1 filter
A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
Suresh Bolusani, Gioni Mexi, Mathieu Besançon +1
This paper proposes and evaluates a Multi-Reference Relaxation Enforced Neighborhood Search (MRENS) heuristic within the SCIP solver. This study marks the first integration and eva…
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…
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…