4 ms·
I think that you've misunderstood what I said. For large instances of this specific problem (and when the time limit is too short to allow either CP-SAT or CPLE
by polivier 3y ago
I think that you've misunderstood what I said. For large instances of this specific problem (and when the time limit is too short to allow either CP-SAT or CPLEX to prove optimality) the best integer feasible solution found by CP-SAT is generally of better quality (w.r.t. the objective value) than the best integer feasible solution found by CPLEX. Furthermore, in some cases, CP-SAT can offer a certificate of optimality faster than CPLEX.
- 7thaccount 3y agoHmmm...for this problem, have you tried Hexaly? Just curious.
- polivier 3y agoNo I haven't, but in our case CP-SAT works very well and license-wise it's free.
- fhk 3y agoYes, highly recommended. There is abit of a gap in modeling approaches to classic MILP but the team are very proactive to make it work. Also very permissive license with unlimited deployment and cores!
- whatever1 3y agoWell these are generic solvers, meaning that they are tuned to perform on a variety of problems well, so you can easily find cases where you get unexpectedly low performance. My advice is if you are on the clock, just use whatever works best out of the box. Now if you plan to solve this problem thousands of times daily, then I would invest in writing custom callbacks in CPLEX to inject feasible solutions during the search since its heuristics are suffering in your problem case.