Learning to Select Cutting Planes in Mixed Integer Linear Programming Solving

Xuefeng Zhang, Liangyu Chen, Zhengfeng Yang +1

Cutting planes (cuts) are crucial for solving Mixed Integer Linear Programming (MILP) problems. Advanced MILP solvers typically rely on manually designed heuristic algorithms for c…