| Name | QuadraticAssignment/QuadraticAssignment-m1-s1/ QuadraticAssignment-nug20.xml |
| MD5SUM | 1ce5b24a466c3cb241db2c2b366e9012 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 1309 |
| Best CPU time to get the best result obtained on this benchmark | 249.508 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 420 |
| Number of constraints | 191 |
| Number of domains | 2 |
| Minimum domain size | 8 |
| Maximum domain size | 20 |
| Distribution of domain sizes | [{"size":8,"count":190},{"size":20,"count":20}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 20 |
| Distribution of variable degrees | [{"degree":0,"count":210},{"degree":2,"count":190},{"degree":20,"count":20}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 20 |
| Distribution of constraint arities | [{"arity":3,"count":190},{"arity":20,"count":1}] |
| Number of extensional constraints | 190 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":190},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1309<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] x[16] x[17] x[18] x[19] 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[0][10] d[0][11] d[0][12] d[0][13] d[0][14] d[0][15] d[0][16] d[0][17] d[0][18] d[0][19] d[1][2] d[1][3] d[1][4] d[1][5] d[1][6] d[1][7] d[1][8] d[1][9] d[1][10] d[1][11] d[1][12] d[1][13] d[1][14] d[1][15] d[1][16] d[1][17] d[1][18] d[1][19] d[2][3] d[2][4] d[2][5] d[2][6] d[2][7] d[2][8] d[2][9] d[2][10] d[2][11] d[2][12] d[2][13] d[2][14] d[2][15] d[2][16] d[2][17] d[2][18] d[2][19] d[3][4] d[3][5] d[3][6] d[3][7] d[3][8] d[3][9] d[3][10] d[3][11] d[3][12] d[3][13] d[3][14] d[3][15] d[3][16] d[3][17] d[3][18] d[3][19] d[4][5] d[4][6] d[4][7] d[4][8] d[4][9] d[4][10] d[4][11] d[4][12] d[4][13] d[4][14] d[4][15] d[4][16] d[4][17] d[4][18] d[4][19] d[5][6] d[5][7] d[5][8] d[5][9] d[5][10] d[5][11] d[5][12] d[5][13] d[5][14] d[5][15] d[5][16] d[5][17] d[5][18] d[5][19] d[6][7] d[6][8] d[6][9] d[6][10] d[6][11] d[6][12] d[6][13] d[6][14] d[6][15] d[6][16] d[6][17] d[6][18] d[6][19] d[7][8] d[7][9] d[7][10] d[7][11] d[7][12] d[7][13] d[7][14] d[7][15] d[7][16] d[7][17] d[7][18] d[7][19] d[8][9] d[8][10] d[8][11] d[8][12] d[8][13] d[8][14] d[8][15] d[8][16] d[8][17] d[8][18] d[8][19] d[9][10] d[9][11] d[9][12] d[9][13] d[9][14] d[9][15] d[9][16] d[9][17] d[9][18] d[9][19] d[10][11] d[10][12] d[10][13] d[10][14] d[10][15] d[10][16] d[10][17] d[10][18] d[10][19] d[11][12] d[11][13] d[11][14] d[11][15] d[11][16] d[11][17] d[11][18] d[11][19] d[12][13] d[12][14] d[12][15] d[12][16] d[12][17] d[12][18] d[12][19] d[13][14] d[13][15] d[13][16] d[13][17] d[13][18] d[13][19] d[14][15] d[14][16] d[14][17] d[14][18] d[14][19] d[15][16] d[15][17] d[15][18] d[15][19] d[16][17] d[16][18] d[16][19] d[17][18] d[17][19] d[18][19] </list> <values> 15 17 10 3 16 2 9 7 0 4 13 1 11 6 5 8 18 14 19 12 0 10 1 0 0 0 2 4 1 5 3 0 1 0 5 2 3 0 1 2 2 5 5 5 2 0 2 5 5 1 1 0 0 1 5 1 0 10 0 0 5 10 5 2 5 2 5 5 0 0 2 1 5 2 5 2 0 2 0 1 0 10 2 5 0 1 5 2 5 2 0 0 5 4 5 1 0 1 2 1 0 2 0 0 0 5 4 5 0 5 3 0 2 5 4 0 1 0 0 1 5 5 5 4 5 0 6 2 5 1 2 0 3 5 0 1 10 0 2 1 2 10 10 2 5 0 0 5 10 2 1 0 5 1 0 1 5 0 6 5 2 5 1 1 5 10 10 2 0 5 5 5 0 2 5 5 1 2 10 10 5 0 10 0 3 2 5 5 2 5 0 0 5 10 2 1 1 2 5 10 0 0 2 5 10 6 0 10 2 5 </values> </instantiation>