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