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