I applied the CP-SAT sovler to sovle a MIQP problem, and it found a optimat result successfully. Do I need to further consider the relaxation method for the problem? Does the CP-SAT sovler support relaxation?
1 Answers
You can have a look at the second part of the CPAIOR 2020 master class on Constraint Programming.
Yes, the solver uses a lot of MIP techniques (presolve, relaxation, cuts) including quadratic cuts. These are all linears, so nothing using cones.
Related