| Name | QuadraticAssignment/QuadraticAssignment-m1-s1/ QuadraticAssignment-tai10b.xml |
| MD5SUM | 8cbeed9b899096335d8f109a5af96966 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 58937 |
| Best CPU time to get the best result obtained on this benchmark | 0.548907 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 110 |
| Number of constraints | 46 |
| Number of domains | 2 |
| Minimum domain size | 10 |
| Maximum domain size | 39 |
| Distribution of domain sizes | [{"size":10,"count":10},{"size":39,"count":45}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":0,"count":55},{"degree":2,"count":45},{"degree":10,"count":10}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":3,"count":45},{"arity":10,"count":1}] |
| Number of extensional constraints | 45 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":45},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 2.0 (complete) | 4397483 | OPT | 58937 | 0.548907 | 0.550761 |
| cosoco 2 (complete) | 4394701 | OPT | 58937 | 0.55506 | 0.555613 |
| cosoco 2.0 (complete) | 4408743 | OPT | 58937 | 0.555208 | 0.55775 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407585 | OPT | 58937 | 1947.18 | 1947.33 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 58937<instantiation type='solution' cost='58937'> <list>d[0][0] 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][0] 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][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][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][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][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][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][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][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][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[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values>* 1 2 15 0 0 172 0 0 0 * * 14 30 0 61 45 0 0 886 * * * 0 0 0 0 0 0 0 * * * * 27 0 0 4 0 202 * * * * * 0 0 1 0 0 * * * * * * 0 0 5 0 * * * * * * * 12 0 1 * * * * * * * * 0 335 * * * * * * * * * 42 * * * * * * * * * * 0 1 3 6 2 5 9 4 7 8 </values> </instantiation>