Name | Knapsack/ Knapsack-50-200-01_c18.xml |
MD5SUM | f3af09ab16e693c32f4df19e0bf70cc2 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 1297 |
Best CPU time to get the best result obtained on this benchmark | 84.6278 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 50 |
Number of constraints | 1 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":50}] |
Minimum variable degree | 2 |
Maximum variable degree | 2 |
Distribution of variable degrees | [{"degree":2,"count":50}] |
Minimum constraint arity | 50 |
Maximum constraint arity | 50 |
Distribution of constraint arities | [{"arity":50,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":1}] |
Optimization problem | YES |
Type of objective | max SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
cosoco 1.12 (complete) | 4300028 | OPT | 1297 | 84.6278 | 84.6353 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300032 | OPT | 1297 | 157.38 | 156.366 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300033 | SAT | 1297 | 302.025 | 300.286 |
GG's minicp 2018-04-29 (complete) | 4300029 | SAT (TO) | 1297 | 2520.02 | 2514.31 |
MiniCPFever 2018-04-29 (complete) | 4300030 | SAT (TO) | 1297 | 2520.04 | 2357.74 |
The dodo solver 2018-04-29 (complete) | 4300034 | SAT (TO) | 1297 | 2520.09 | 2512.61 |
slowpoke 2018-04-29 (incomplete) | 4300031 | SAT (TO) | 719 | 2520.02 | 2513.71 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1297<instantiation type='solution' cost='1297'> <list>x[0] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[1] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[2] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[3] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values>0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 1 1 1 1 1 0 1 0 0 1 0 0 0 0 0 0 0 0 1 1 1 1 0 1 0 0 </values> </instantiation>