| Name | QuadraticAssignment/QuadraticAssignment-m1-s1/ QuadraticAssignment-tai10a.xml |
| MD5SUM | b58690ea851c8aad9573a552336d280c |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 67514 |
| Best CPU time to get the best result obtained on this benchmark | 30.0701 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 110 |
| Number of constraints | 46 |
| Number of domains | 2 |
| Minimum domain size | 10 |
| Maximum domain size | 35 |
| Distribution of domain sizes | [{"size":10,"count":10},{"size":35,"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 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 67514<instantiation id='sol14' type='solution' cost='67514'> <list> x[] d[][] </list> <values> 8 0 7 5 9 4 3 2 6 1 * 10 61 76 21 45 82 12 57 0 * * 25 41 4 56 82 95 6 21 * * * 18 36 86 35 84 18 79 * * * * 39 69 91 1 59 40 * * * * * 91 26 0 36 89 * * * * * * 26 9 56 44 * * * * * * * 35 11 6 * * * * * * * * 85 63 * * * * * * * * * 75 * * * * * * * * * * </values> </instantiation>