Name | BinPacking/BinPacking-sum-s28/ BinPacking-sum-s28-561.xml |
MD5SUM | 0151e8a579557b2b9e30bd86d2d74102 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 1901 |
Number of constraints | 203 |
Number of domains | 2 |
Minimum domain size | 101 |
Maximum domain size | 178 |
Distribution of domain sizes | [{"size":101,"count":1},{"size":178,"count":1900}] |
Minimum variable degree | 2 |
Maximum variable degree | 5 |
Distribution of variable degrees | [{"degree":2,"count":1},{"degree":4,"count":1800},{"degree":5,"count":100}] |
Minimum constraint arity | 19 |
Maximum constraint arity | 1900 |
Distribution of constraint arities | [{"arity":19,"count":200},{"arity":101,"count":1},{"arity":1900,"count":2}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"ordered","count":100},{"type":"lex","count":1},{"type":"sum","count":100},{"type":"count","count":1},{"type":"cardinality","count":1}] |
Optimization problem | YES |
Type of objective | max VAR |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: