Name | BinPacking/ BinPacking-tab-fu/BinPacking-tab-fu0250-15.xml |
MD5SUM | 5cb0a900f4910e71305eb4c61f82b136 |
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 | 877 |
Number of constraints | 149 |
Number of domains | 2 |
Minimum domain size | 79 |
Maximum domain size | 147 |
Distribution of domain sizes | [{"size":79,"count":876},{"size":147,"count":1}] |
Minimum variable degree | 2 |
Maximum variable degree | 4 |
Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":730},{"degree":4,"count":146}] |
Minimum constraint arity | 6 |
Maximum constraint arity | 876 |
Distribution of constraint arities | [{"arity":6,"count":146},{"arity":147,"count":1},{"arity":876,"count":2}] |
Number of extensional constraints | 146 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":146},{"type":"lex","count":1},{"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: