67 citations · 73 across the 7 of their papers we have counts for
8 papers
The SCIP Optimization Suite 9.0
Suresh Bolusani, Mathieu Besançon, Ksenia Bestuzheva +28
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This…
PySCIPOpt-ML: Embedding Trained Machine Learning Models into Mixed-Integer Programs
Mark Turner, Antonia Chmiela, Thorsten Koch +1
A standard tool for modelling real-world optimisation problems is mixed-integer programming (MIP). However, for many of these problems, information about the relationships between…
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…
Faster exact solution of sparse MaxCut and QUBO problems
Daniel Rehfeldt, Thorsten Koch, Yuji Shinano
The maximum-cut problem is one of the fundamental problems in combinatorial optimization. With the advent of quantum computers, both the maximum-cut and the equivalent quadratic un…
Adaptive Cut Selection in Mixed-Integer Linear Programming
Mark Turner, Thorsten Koch, Felipe Serrano +1
Cutting plane selection is a subroutine used in all modern mixed-integer linear programming solvers with the goal of selecting a subset of generated cuts that induce optimal solver…