Adaptive cut selection in mixed-integer linear programming

DOI10.5802/ojmo.25zbMath1522.90045arXiv2202.10962OpenAlexW4384931918MaRDI QIDQ6168887

Michael Winkler, Mark G. Turner, Felipe Serrano, Thorsten Koch

Publication date: 9 August 2023

Published in: OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.10962

zbMATH Keywords

mixed-integer linear programmingcutting plane selectioninstance-dependent learning

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Cutting plane selection with analytic centers and multiregression, Online learning for scheduling MIP heuristics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cutting planes in integer and mixed integer programming
• Theoretical challenges towards cutting-plane selection
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite
• Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
• Presolve Reductions in Mixed Integer Programming
• An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs
• Mixed Integer Programming: Analyzing 12 Years of Progress