Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs

11/11/2020
by   Matthias Walter, et al.
0

Cutting planes are a key ingredient to successfully solve mixed-integer linear programs. For specific problems, their strength is often theoretically assessed by showing that they are facet-defining for the corresponding mixed-integer hull. In this paper we experimentally investigate the dimensions of faces induced by general-purpose cutting planes generated by a state-of-the-art solver. Therefore, we relate the dimension of each cutting plane to its impact in a branch-and-bound algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
03/03/2021

Stochastic Cutting Planes for Data-Driven Optimization

We introduce a stochastic version of the cutting-plane method for a larg...
research
08/11/2022

General Cutting Planes for Bound-Propagation-Based Neural Network Verification

Bound propagation methods, when combined with branch and bound, are amon...
research
03/12/2020

A Polyhedral Approach to Bisubmodular Function Minimization

We consider minimization problems with bisubmodular objective functions....
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...
research
11/01/2021

Mixed-Integer Programming for the ROADEF/EURO 2020 challenge

The ROADEF 2020 challenge presents a maintenance scheduling problem from...
research
11/12/2021

SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs

We study a class of bilevel integer programs with second-order cone cons...

Please sign up or login with your details

Forgot password? Click here to reset