| Name | QuadraticAssignment/QuadraticAssignment-m1-s1/ QuadraticAssignment-sko81.xml |
| MD5SUM | 7967f0a5d6026ea184db99fec624e08d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 50175 |
| Best CPU time to get the best result obtained on this benchmark | 252.034 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 6642 |
| Number of constraints | 3241 |
| Number of domains | 2 |
| Minimum domain size | 8 |
| Maximum domain size | 81 |
| Distribution of domain sizes | [{"size":8,"count":3240},{"size":81,"count":81}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 81 |
| Distribution of variable degrees | [{"degree":0,"count":3321},{"degree":2,"count":3240},{"degree":81,"count":81}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 81 |
| Distribution of constraint arities | [{"arity":3,"count":3240},{"arity":81,"count":1}] |
| Number of extensional constraints | 3240 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":3240},{"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: 50175--too large--