Cut-Based Conflict Analysis in Mixed Integer Programming

For almost two decades, mixed integer programming (MIP) solvers have used graph-based conflict analysis to learn from local infeasibilities during branch-and-bound search. In this paper, we improve MIP conflict analysis by, instead, using reasoning based on cuts inspired by the development of conflict-driven solvers for pseudo-Boolean optimization. Phrased in MIP terminology, this type of conflict analysis can be understood as a sequence of linear combinations, integer roundings, and cut generation. We leverage this MIP perspective to design a new conflict analysis algorithm based on mixed integer rounding cuts, and this theoretically dominates the state-of-the-art method in pseudo-Boolean optimization using Chvátal–Gomory cuts. Furthermore, we extend this cut-based conflict analysis from pure binary programs to mixed binary programs and—in limited form—to general MIP with also integer-valued variables. We perform an empirical evaluation of cut-based conflict analysis as implemented in the open-source MIP solver Solving Constraint Integer Programs (SCIP), testing it on a large and diverse set of MIP instances from MIPLIB2017. Our experimental results indicate that the new algorithm improves the default performance of SCIP in terms of running time, number of nodes in the search tree, and the number of instances solved. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Funding: This work was supported by the Research Campus Modal funded by the German Federal Ministry of Research, Technology, and Space [Grants 05M14ZAM, 05M20ZBM]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0999 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0999 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Authors

Institutions

Publication Details

Journal
INFORMS journal on computing
Published
2025-11-12
DOI
https://doi.org/10.1287/ijoc.2024.0999
Primary Topic
Constraint Satisfaction and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cut-Based Conflict Analysis in Mixed Integer Programming

Jakob Nordstr”öm, Ambros Gleixner, Felipe Serrano, Gioni Mexi et al.
INFORMS journal on computing
Constraint Satisfaction and Optimization
article

Cut-Based Conflict Analysis in Mixed Integer Programming

Jakob Nordstr”öm, Ambros Gleixner, Felipe Serrano, Gioni Mexi, Timo Berthold
article en

Abstract

For almost two decades, mixed integer programming (MIP) solvers have used graph-based conflict analysis to learn from local infeasibilities during branch-and-bound search. In this paper, we improve MIP conflict analysis by, instead, using reasoning based on cuts inspired by the development of conflict-driven solvers for pseudo-Boolean optimization. Phrased in MIP terminology, this type of conflict analysis can be understood as a sequence of linear combinations, integer roundings, and cut generation. We leverage this MIP perspective to design a new conflict analysis algorithm based on mixed integer rounding cuts, and this theoretically dominates the state-of-the-art method in pseudo-Boolean optimization using Chvátal–Gomory cuts. Furthermore, we extend this cut-based conflict analysis from pure binary programs to mixed binary programs and—in limited form—to general MIP with also integer-valued variables. We perform an empirical evaluation of cut-based conflict analysis as implemented in the open-source MIP solver Solving Constraint Integer Programs (SCIP), testing it on a large and diverse set of MIP instances from MIPLIB2017. Our experimental results indicate that the new algorithm improves the default performance of SCIP in terms of running time, number of nodes in the search tree, and the number of instances solved. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Funding: This work was supported by the Research Campus Modal funded by the German Federal Ministry of Research, Technology, and Space [Grants 05M14ZAM, 05M20ZBM]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0999 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0999 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

INFORMS journal on computing
HTW Berlin - University of Applied Sciences (DE), University of Copenhagen (DK), Lund University (SE), Zuse Institute Berlin (DE), Cardinal Health (Australia) (AU), Technische Universität Berlin (DE)
Openalex Percentile: Top 61%
Constraint Satisfaction and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.