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