| Name | QuadraticAssignment/ QuadraticAssignment-esc16a_c18.xml |
| MD5SUM | 33cd07532de3d8b94fe29f3b9aee1e6b |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 34 |
| Best CPU time to get the best result obtained on this benchmark | 20065.2 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 272 |
| Number of constraints | 39 |
| Number of domains | 2 |
| Minimum domain size | 4 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":4,"count":38},{"size":16,"count":16}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":0,"count":218},{"degree":1,"count":6},{"degree":2,"count":38},{"degree":7,"count":2},{"degree":8,"count":4},{"degree":10,"count":4}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":3,"count":38},{"arity":16,"count":1}] |
| Number of extensional constraints | 38 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":38},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291086 | OPT | 34 | 14574.9 | 1986.61 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308855 | OPT | 34 | 17876.4 | 2464.53 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297499 | SAT (TO) | 34 | 20065.2 | 2520.11 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 34<instantiation> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] d[0][1] d[0][2] d[0][3] d[0][4] d[0][5] d[0][6] d[0][7] d[0][8] d[0][9] d[1][2] d[1][3] d[1][4] d[1][7] d[1][8] d[1][9] d[2][3] d[2][7] d[2][8] d[2][9] d[3][6] d[3][7] d[3][8] d[3][9] d[4][5] d[4][6] d[4][7] d[4][8] d[4][9] d[5][6] d[5][7] d[5][8] d[5][9] d[6][7] d[6][8] d[6][9] d[7][8] d[7][9] d[8][9] </list> <values> 10 0 2 3 12 14 15 9 11 8 13 7 6 5 4 1 1 0 1 1 0 1 1 0 0 0 1 1 1 2 0 0 2 1 1 1 1 0 2 0 1 1 2 0 0 2 1 1 1 0 2 0 0 1 </values> </instantiation>