Cutting plane selection with analytic centers and multiregression
From MaRDI portal
Publication:6057245
DOI10.1007/978-3-031-33271-5_4arXiv2212.07231MaRDI QIDQ6057245
Mark G. Turner, Timo Berthold, Thorsten Koch, Mathieu Besançon
Publication date: 4 October 2023
Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.07231
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Improving branch-and-cut performance by random sampling
- Recursive central rounding for mixed integer programs
- Using the analytic center in the feasibility pump
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite
- Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
- On Counting Lattice Points and Chvátal-Gomory Cutting Planes
- Can Pure Cutting Plane Algorithms Work?
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- Integer Programming
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Adaptive cut selection in mixed-integer linear programming
This page was built for publication: Cutting plane selection with analytic centers and multiregression
