| Name | PrizeCollecting/PrizeCollecting-jok-s1/ PrizeCollecting-25-5-5-9.xml |
| MD5SUM | 01e24d77724351f9fbbc9dc0447b7ef7 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 65 |
| Best CPU time to get the best result obtained on this benchmark | 82.2388 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 75 |
| Number of constraints | 101 |
| Number of domains | 25 |
| Minimum domain size | 4 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":4,"count":15},{"size":5,"count":6},{"size":6,"count":4},{"size":26,"count":50}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 28 |
| Distribution of variable degrees | [{"degree":2,"count":25},{"degree":26,"count":24},{"degree":27,"count":1},{"degree":28,"count":25}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 26 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":2,"count":50},{"arity":25,"count":25},{"arity":26,"count":25}] |
| Number of extensional constraints | 50 |
| Number of intensional constraints | 26 |
| Distribution of constraint types | [{"type":"extension","count":50},{"type":"intension","count":26},{"type":"count","count":25}] |
| Optimization problem | YES |
| Type of objective | max SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 65<instantiation id='sol15' type='solution' cost='65'> <list> s[] p[] g[] </list> <values> 5 0 -1 8 3 10 1 6 7 4 15 12 17 14 9 16 11 22 13 -1 -1 -1 23 18 -1 0 19 -1 15 14 1 18 17 16 13 2 5 6 11 12 3 4 7 10 -1 -1 -1 8 9 -1 5 1 0 6 8 -2 1 8 6 -4 0 4 4 4 7 2 4 0 6 0 0 0 7 -2 0 </values> </instantiation>