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