Learning to use local cuts

DOI10.1007/S12532-025-00278-YMaRDI QIDQ6912334zbMATH OpenFDO

Authors Timo Berthold, Matteo Francobaldi, Gregor Hendel

Publication date 22 October 2025

Published in Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12532-025-00278-Y

zbMATH Keywords

cutting planesmachine learningmixed integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites work

• A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
• Algorithm runtime prediction: methods \& evaluation
• Computational aspects of infeasibility analysis in mixed integer programming
• Computational Integer Programming and Cutting Planes
• Conflict Analysis for MINLP
• Conflict analysis in mixed integer programming
• Cutting planes in integer and mixed integer programming
• scientific article; zbMATH DE number 2084777 (Why is no real title available?)
• scientific article; zbMATH DE number 7124428 (Why is no real title available?)
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Measuring the impact of primal heuristics
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Mixed integer programming: analyzing 12 years of progress
• Parallelization of the FICO Xpress-Optimizer
• Presolve Reductions in Mixed Integer Programming
• Problems in the Analysis of Survey Data, and a Proposal
• Symmetry in integer linear programming
• The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
• Understanding machine learning. From theory to algorithms
• Valid inequalities for mixed integer linear programs

Cited in

(1)

• Learning to choose branching rules for nonconvex MINLPs

This page was built for publication: Learning to use local cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912334)