| Name | QuadraticAssignment/QuadraticAssignment-m1-s1/ QuadraticAssignment-tai80a.xml |
| MD5SUM | c9a66f606132a3c8760ec6756f0c4250 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 7376034 |
| Best CPU time to get the best result obtained on this benchmark | 251.92 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 6480 |
| Number of constraints | 3128 |
| Number of domains | 2 |
| Minimum domain size | 80 |
| Maximum domain size | 100 |
| Distribution of domain sizes | [{"size":80,"count":80},{"size":100,"count":3127}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 80 |
| Distribution of variable degrees | [{"degree":0,"count":3273},{"degree":2,"count":3127},{"degree":77,"count":3},{"degree":78,"count":14},{"degree":79,"count":29},{"degree":80,"count":34}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 80 |
| Distribution of constraint arities | [{"arity":3,"count":3127},{"arity":80,"count":1}] |
| Number of extensional constraints | 3127 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":3127},{"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: 7376034--too large--