Lines Matching refs:tour
1134 Tsp_index_t* tour;
1171 * generate a tour
1175 sfprintf(sfstderr, "generate a tour\n");
1181 if (!(tour = tsptour(tsp)))
1185 * break tour at most expensive link; put order into self
1189 breakval = cost[tour[end]][tour[0]];
1191 if (cost[tour[i]][tour[i+1]] > breakval)
1194 breakval = cost[tour[i]][tour[i+1]];
1198 self[j++] = tour[i];
1200 self[j++] = tour[i];
1226 * partition according to dependence along tour