| Name | QuadraticAssignment/ QuadraticAssignment-esc16d_c18.xml |
| MD5SUM | 797dd3ed6ca3fcac5df6221abf320949 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 8 |
| Best CPU time to get the best result obtained on this benchmark | 190.048 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 272 |
| Number of constraints | 22 |
| Number of domains | 2 |
| Minimum domain size | 4 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":4,"count":21},{"size":16,"count":16}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 7 |
| Distribution of variable degrees | [{"degree":0,"count":235},{"degree":1,"count":2},{"degree":2,"count":22},{"degree":3,"count":6},{"degree":4,"count":2},{"degree":5,"count":3},{"degree":6,"count":1},{"degree":7,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":3,"count":21},{"arity":16,"count":1}] |
| Number of extensional constraints | 21 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":21},{"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) | 4291087 | OPT | 8 | 85.3268 | 14.2358 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308856 | OPT | 8 | 94.4619 | 14.4249 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297500 | OPT | 8 | 190.048 | 24.597 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 8<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][3] d[0][4] d[1][6] d[1][8] d[1][11] d[1][14] d[2][12] d[2][14] d[3][4] d[6][8] d[6][11] d[6][14] d[7][9] d[8][11] d[8][14] d[9][10] d[10][13] d[11][12] d[11][13] d[11][14] d[12][13] </list> <values> 10 14 9 3 2 1 12 5 13 4 6 15 11 7 8 0 1 0 0 1 0 1 0 0 0 0 1 0 0 0 1 0 0 0 0 2 1 </values> </instantiation>