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?
Asked
Active
Viewed 90 times
1
-
That's a very good question, keep up the good work! – OCP30pt1c1l1l43-X1z17 Jul 08 '22 at 08:16
1 Answers
0
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.
Laurent Perron
- 8,594
- 1
- 8
- 22