| Name | Knapsack/Knapsack-m1-s30/ Knapsack-30-100-06.xml |
| MD5SUM | 3ceda869c276348ad0b4fc7c9d738878 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 1188 |
| Best CPU time to get the best result obtained on this benchmark | 0.968234 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 1 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":30}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":30}] |
| Minimum constraint arity | 30 |
| Maximum constraint arity | 30 |
| Distribution of constraint arities | [{"arity":30,"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-mini 1.1 (2017-06-27) (complete) | 4253104 | OPT | 1188 | 0.968234 | 0.970809 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4259880 | OPT | 1188 | 0.96894699 | 1.06419 |
| cosoco-mini 1.12 (complete) | 4267061 | OPT | 1188 | 0.97871399 | 1.0426 |
| Naxos 1.1.0 (complete) | 4253105 | OPT | 1188 | 3.67803 | 3.6791 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1188<instantiation type='solution' cost='1188'> <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] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] </list> <values>1 1 0 1 1 1 1 1 0 0 1 0 0 1 0 0 1 1 1 0 0 1 0 0 0 1 0 1 1 0 </values> </instantiation>