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

07/14/2023
by   Mark Turner, et al.
0

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.

READ FULL TEXT
research
05/28/2021

Learning to Select Cuts for Efficient Mixed-Integer Programming

Cutting plane methods play a significant role in modern solvers for tack...
research
02/22/2022

Adaptive Cut Selection in Mixed-Integer Linear Programming

Cut selection is a subroutine used in all modern mixed-integer linear pr...
research
06/09/2023

Branching via Cutting Plane Selection: Improving Hybrid Branching

Cutting planes and branching are two of the most important algorithms fo...
research
06/27/2022

Learning To Cut By Looking Ahead: Cutting Plane Selection via Imitation Learning

Cutting planes are essential for solving mixed-integer linear problems (...
research
08/18/2023

A new branch-and-cut approach for integrated planning in additive manufacturing

In recent years, there has been considerable interest in the transformat...
research
08/29/2018

Unified Receiver Design in Wireless Relay Networks Using Mixed-Integer Programming Techniques

Wireless receiver design is critical to the overall system performance. ...
research
12/14/2022

Cutting Plane Selection with Analytic Centers and Multiregression

Cutting planes are a crucial component of state-of-the-art mixed-integer...

Please sign up or login with your details

Forgot password? Click here to reset