| Name | QuadraticAssignment/QuadraticAssignment-m1-s1/ QuadraticAssignment-chr15a.xml |
| MD5SUM | 2cf522cde643a9876c78ef6348327f24 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 4948 |
| Best CPU time to get the best result obtained on this benchmark | 6.43245 |
| 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 | 4 |
| Distribution of variable degrees | [{"degree":0,"count":211},{"degree":2,"count":19},{"degree":3,"count":7},{"degree":4,"count":3}] |
| 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: 4948<instantiation id='sol30' type='solution' cost='4948'> <list> x[] d[][] </list> <values> 4 9 7 12 11 10 13 1 3 5 6 14 2 0 8 * 14 1 2 * * * * * * * * * * * * * * * 13 * * * * * * * * * * * * * * * 39 12 * * * * * * * * * * * * * * * 4 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 20 * * * * * * * * * * * * * * * 38 3 * * * * * * * * * * * * * * * 1 * * * * * * * * * * * * * * * 50 * * * * * * * * * * * * * * * 5 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 4 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * </values> </instantiation>