| Name | TravellingSalesman/ TravellingSalesman-10-20-00_c18.xml |
| MD5SUM | 41acc49479871df381e8fa6a150e4ace |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 47 |
| Best CPU time to get the best result obtained on this benchmark | 1.94647 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 20 |
| Number of constraints | 11 |
| Number of domains | 2 |
| Minimum domain size | 10 |
| Maximum domain size | 19 |
| Distribution of domain sizes | [{"size":10,"count":10},{"size":19,"count":10}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":10},{"degree":3,"count":10}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":3,"count":10},{"arity":10,"count":1}] |
| Number of extensional constraints | 10 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":10},{"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: 47<instantiation type="optimum" cost="47"> <list> c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] d[0] d[1] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] </list> <values> 0 1 5 4 9 7 6 8 2 3 3 2 2 5 4 6 7 3 2 13 </values> </instantiation>