67 citations · 89 across the 11 of their papers we have counts for
12 papers
The SCIP Optimization Suite 10.0
Christopher Hojny, Mathieu Besançon, Ksenia Bestuzheva +31
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This…
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…
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…
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…
Controlling transient gas flow in real-world pipeline intersection areas
Felix Hennings, Lovis Anderson, Kai Hoppmann-Baum +2
Compressor stations are the heart of every high-pressure gas transport network. Located at intersection areas of the network they are contained in huge complex plants, where they a…
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…
Generative deep learning for decision making in gas networks
Lovis Anderson, Mark Turner, Thorsten Koch
A decision support system relies on frequent re-solving of similar problem instances. While the general structure remains the same in corresponding applications, the input paramete…