Name | /OPT-SMALLINT-LIN/heinz/ normalized-neos-807456.opb |
MD5SUM | 21cf0355c32a3177f2f6fa914b5dacc6 |
Bench Category | OPT-SMALLINT-LIN (optimisation, small integers, linear constraints) |
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 | |
Has Objective Function | YES |
Satisfiable | |
(Un)Satisfiability was proved | |
Best value of the objective function | |
Optimality of the best value was proved | |
Number of variables | 1635 |
Total number of constraints | 840 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 840 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 9 |
Number of terms in the objective function | 1635 |
Biggest coefficient in the objective function | 1 |
Number of bits for the biggest coefficient in the objective function | 1 |
Sum of the numbers in the objective function | 1635 |
Number of bits of the sum of numbers in the objective function | 11 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 1635 |
Number of bits of the biggest sum of numbers | 11 |
Number of products (including duplicates) | 0 |
Sum of products size (including duplicates) | 0 |
Number of different products | 0 |
Sum of products size | 0 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: