2019 XCSP3 competition: fast COP track (sequential and parallel solvers): benchmarks results per solver

Result page for solver cosoco 2.0 (complete)

Category "optimization problem" (COP)

Solver proved unsatisfiability (UNSATISFIABLE) (1 run) [Show/Hide]

Solver found optimum (OPTIMUM FOUND) (116 runs) [Show/Hide]

Solver timed out but found at least a solution (107 runs) [Show/Hide]

Solver does not handle one of the constraint (15 runs) [Show/Hide]

Solver timed out (no solution given) (28 runs) [Show/Hide]

Solver exceeded the memory limit (no solution given) (33 runs) [Show/Hide]