model tsp0.mod;
data tsp.dat;
#data germany.dat;
#display subtours;
for {i in V, j in V : i > j} {
  let d[i,j] := d[j,i];
}
option solver cplex;
solve;
display distance;
#display x;

param i default 1; 
printf "Subtour: 1";
repeat {
   let i:= sum {j in V} j*x[i,j];
   # if (i==1) then break;
   printf ", %d",  i;
} until i=1;
printf ".\n\n";