Name | QuadraticAssignment/QuadraticAssignment-m1-s1/ QuadraticAssignment-esc16e.xml |
MD5SUM | 9478703244e8f640224ac5c9e01083b8 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 14 |
Best CPU time to get the best result obtained on this benchmark | 13.1433 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 272 |
Number of constraints | 22 |
Number of domains | 2 |
Minimum domain size | 4 |
Maximum domain size | 16 |
Distribution of domain sizes | [{"size":4,"count":21},{"size":16,"count":16}] |
Minimum variable degree | 0 |
Maximum variable degree | 7 |
Distribution of variable degrees | [{"degree":0,"count":235},{"degree":1,"count":7},{"degree":2,"count":23},{"degree":5,"count":1},{"degree":7,"count":6}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 16 |
Distribution of constraint arities | [{"arity":3,"count":21},{"arity":16,"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: 14<instantiation id='sol6' type='solution' cost='14'> <list> x[] d[][] </list> <values> 2 11 6 3 4 5 7 1 0 8 9 10 12 13 14 15 * * 0 0 * 2 1 1 0 * * * * * * * * * * 0 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 1 0 0 1 * * * * * * * * * * * * 0 1 1 0 * * * * * * * * * * * * * 0 0 1 * * * * * * * * * * * * * * 1 2 * * * * * * * * * * * * * * * 0 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * </values> </instantiation>