| Name | TravellingSalesman/TravellingSalesman-m1-n25/ TravellingSalesman-25-30-03.xml |
| MD5SUM | 08a8e4115660d732ba32388826654d85 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 130 |
| Best CPU time to get the best result obtained on this benchmark | 1885.32 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 26 |
| Number of domains | 2 |
| Minimum domain size | 25 |
| Maximum domain size | 33 |
| Distribution of domain sizes | [{"size":25,"count":25},{"size":33,"count":25}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":25},{"degree":3,"count":25}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 25 |
| Distribution of constraint arities | [{"arity":3,"count":25},{"arity":25,"count":1}] |
| Number of extensional constraints | 25 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":25},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 130<instantiation> <list> d[] c[] </list> <values> 6 4 3 5 2 10 6 4 4 2 4 4 5 6 6 14 2 3 6 4 3 2 12 4 9 24 20 17 15 12 9 2 0 3 5 4 7 10 8 6 1 11 14 13 16 21 22 23 19 18 </values> </instantiation>