A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming
This work addresses optimization efficiency for users of mixed-integer programming solvers, but it is incremental as it extends an existing algorithm.
The paper tackled the problem of cut selection in mixed-integer programming solvers by proposing new cut scoring measures, filtering techniques, and stopping criteria, resulting in a 5% performance improvement for SCIP on the MIPLIB 2017 benchmark set.
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.