| Name | QuadraticAssignment/QuadraticAssignment-m1-s1/ QuadraticAssignment-chr15c.xml |
| MD5SUM | ce755c39cb9d6ddef8bea85f09074509 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 4752 |
| Best CPU time to get the best result obtained on this benchmark | 7.91615 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 240 |
| Number of constraints | 15 |
| Number of domains | 2 |
| Minimum domain size | 15 |
| Maximum domain size | 64 |
| Distribution of domain sizes | [{"size":15,"count":15},{"size":64,"count":14}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":0,"count":211},{"degree":2,"count":16},{"degree":3,"count":13}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 15 |
| Distribution of constraint arities | [{"arity":3,"count":14},{"arity":15,"count":1}] |
| Number of extensional constraints | 14 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":14},{"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: 4752<instantiation id='sol34' type='solution' cost='4752'> <list> x[] d[][] </list> <values> 12 1 4 6 7 0 13 5 3 2 14 8 11 10 9 * 4 2 * * * * * * * * * * * * * * * 3 * * * * * * * * * * * * * * * 1 * * * * * * * * * * * * * * * 5 * * * * * * * * * * * * * * * 12 * * * * * * * * * * * * * * * 39 * * * * * * * * * * * * * * * 20 * * * * * * * * * * * * * * * 50 * * * * * * * * * * * * * * * 1 * * * * * * * * * * * * * * * 4 * * * * * * * * * * * * * * * 11 * * * * * * * * * * * * * * * 10 * * * * * * * * * * * * * * * 13 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * </values> </instantiation>