A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming

TL;DR

This paper introduces a new set of cut scoring, filtering, and stopping techniques for mixed-integer programming solvers, leading to a 5% performance boost on benchmark problems.

Contribution

It extends the existing cut selection algorithm with novel scoring measures and filtering techniques, improving solver efficiency.

Findings

Achieved a 5% performance improvement on MIPLIB 2017 benchmarks.

Developed new cut scoring measures and filtering techniques.

Enhanced the stopping criteria for cut selection.

Abstract

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 measures, cut filtering techniques, and stopping criteria, extending the current state-of-the-art algorithm and obtaining a 5\% performance improvement for SCIP over the MIPLIB 2017 benchmark set.