Name | QuadraticAssignment/ QuadraticAssignment-qap_c18.xml |
MD5SUM | ae953de311e4ef2e73bebc6e6ca1406d |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 4776 |
Best CPU time to get the best result obtained on this benchmark | 3.80009 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 156 |
Number of constraints | 12 |
Number of domains | 2 |
Minimum domain size | 12 |
Maximum domain size | 51 |
Distribution of domain sizes | [{"size":12,"count":12},{"size":51,"count":11}] |
Minimum variable degree | 0 |
Maximum variable degree | 5 |
Distribution of variable degrees | [{"degree":0,"count":133},{"degree":2,"count":16},{"degree":3,"count":5},{"degree":4,"count":1},{"degree":5,"count":1}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 12 |
Distribution of constraint arities | [{"arity":3,"count":11},{"arity":12,"count":1}] |
Number of extensional constraints | 11 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":11},{"type":"allDifferent","count":1}] |
Optimization problem | YES |
Type of objective | min SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297509 | OPT | 4776 | 3.80009 | 0.96087 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4308865 | OPT | 4776 | 8.18836 | 2.85743 |
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291096 | OPT | 4776 | 8.39767 | 2.67405 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 4776<instantiation> <list>x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] d[0][1] d[0][2] d[0][3] d[0][4] d[1][5] d[2][6] d[2][7] d[5][8] d[7][9] d[8][10] d[9][11] </list> <values>6 4 11 1 0 2 8 10 9 5 7 3 5 37 30 9 10 33 18 61 0 12 12 </values> </instantiation>