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