Continuous cutting plane algorithms in integer programming

Didier Chételat, Andrea Lodi

Cutting planes for mixed-integer linear programs (MILPs) are typically computed in rounds by iteratively solving optimization problems, the so-called separation. Instead, we refram…