| Name | TravellingSalesman/TravellingSalesman-m1-n15/ TravellingSalesman-15-30-04.xml |
| MD5SUM | 3ec1135b215453db38ac12e83e420ae6 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 116 |
| Best CPU time to get the best result obtained on this benchmark | 84.9302 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 16 |
| Number of domains | 2 |
| Minimum domain size | 15 |
| Maximum domain size | 28 |
| Distribution of domain sizes | [{"size":15,"count":15},{"size":28,"count":15}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":15},{"degree":3,"count":15}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 15 |
| Distribution of constraint arities | [{"arity":3,"count":15},{"arity":15,"count":1}] |
| Number of extensional constraints | 15 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":15},{"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: 116<instantiation> <list> d[] c[] </list> <values> 6 7 6 6 6 5 8 8 10 13 14 9 4 10 4 2 5 9 6 7 10 11 14 12 13 8 1 4 3 0 </values> </instantiation>