| Name | QuadraticAssignment/ QuadraticAssignment-qap_c18.xml |
| MD5SUM | ae953de311e4ef2e73bebc6e6ca1406d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 4776 |
| Best CPU time to get the best result obtained on this benchmark | 0.378238 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 156 |
| Number of constraints | 12 |
| Number of domains | 2 |
| Minimum domain size | 12 |
| Maximum domain size | 51 |
| Distribution of domain sizes | [{"size":12,"count":12},{"size":51,"count":11}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":0,"count":133},{"degree":2,"count":16},{"degree":3,"count":5},{"degree":4,"count":1},{"degree":5,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 12 |
| Distribution of constraint arities | [{"arity":3,"count":11},{"arity":12,"count":1}] |
| Number of extensional constraints | 11 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":11},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4298955 | OPT | 4776 | 0.378238 | 0.37806 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298959 | OPT | 4776 | 1.93813 | 0.850675 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298960 | SAT | 4776 | 301.842 | 300.32 |
| The dodo solver 2018-04-29 (complete) | 4298961 | SAT (TO) | 4776 | 2520.07 | 2517.61 |
| MiniCPFever 2018-04-29 (complete) | 4298957 | SAT (TO) | 4776 | 2520.09 | 2511.81 |
| slowpoke 2018-04-29 (incomplete) | 4298958 | SAT (TO) | 4776 | 2520.1 | 2514.81 |
| GG's minicp 2018-04-29 (complete) | 4298956 | SAT (TO) | 5344 | 2520.05 | 2516.91 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 4776<instantiation type='solution' cost='4776'> <list>d[0][0] d[0][10] d[0][11] 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[10][0] d[10][10] d[10][11] d[10][1] d[10][2] d[10][3] d[10][4] d[10][5] d[10][6] d[10][7] d[10][8] d[10][9] d[11][0] d[11][10] d[11][11] d[11][1] d[11][2] d[11][3] d[11][4] d[11][5] d[11][6] d[11][7] d[11][8] d[11][9] d[1][0] d[1][10] d[1][11] d[1][1] 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[2][0] d[2][10] d[2][11] d[2][1] d[2][2] d[2][3] d[2][4] d[2][5] d[2][6] d[2][7] d[2][8] d[2][9] d[3][0] d[3][10] d[3][11] d[3][1] d[3][2] d[3][3] d[3][4] d[3][5] d[3][6] d[3][7] d[3][8] d[3][9] d[4][0] d[4][10] d[4][11] d[4][1] d[4][2] d[4][3] d[4][4] d[4][5] d[4][6] d[4][7] d[4][8] d[4][9] d[5][0] d[5][10] d[5][11] d[5][1] d[5][2] d[5][3] d[5][4] d[5][5] d[5][6] d[5][7] d[5][8] d[5][9] d[6][0] d[6][10] d[6][11] d[6][1] d[6][2] d[6][3] d[6][4] d[6][5] d[6][6] d[6][7] d[6][8] d[6][9] d[7][0] d[7][10] d[7][11] d[7][1] d[7][2] d[7][3] d[7][4] d[7][5] d[7][6] d[7][7] d[7][8] d[7][9] d[8][0] d[8][10] d[8][11] d[8][1] d[8][2] d[8][3] d[8][4] d[8][5] d[8][6] d[8][7] d[8][8] d[8][9] d[9][0] d[9][10] d[9][11] d[9][1] d[9][2] d[9][3] d[9][4] d[9][5] d[9][6] d[9][7] d[9][8] d[9][9] x[0] x[10] x[11] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values>* * * 5 37 30 9 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 10 * * * * * * * * * * * * 33 18 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 61 * * * * * * * * * * * * * * * * * * * * * * * * 0 * 12 * * * * * * * * * * * * 12 * * * * * * * * * 6 7 3 4 11 1 0 2 8 10 9 5 </values> </instantiation>