### Table 1: Symmetric travelling salesman problems

2000

"... In PAGE 1: ... After each 100st generation the best elements are exchanged between the PNs. The results obtained are given in Table1 in the last column. The second column de- scribes the results obtained by a reimplementation of the same algorithm on a Sun UltraSparc1.... ..."

Cited by 1

### Table 3: Statistics of a run of ts225 The root node was nished in less than 15 minutes. In our best run, it solved in 35 BC nodes. 6 Conclusions and perspectives We have shown that very simple separation heuristics can yield very good results on large instances of the symmetric traveling salesman problem. The

1998

"... In PAGE 30: ... Note that these are not our best runs, but our latest ones. The Table3 gives the statistics of a run of ts225. In that table Big tooth refers to a tooth containing all the others, and Nested Ladder to a ladder with a handle containing the other.... ..."

Cited by 9

### Table 8: Results for the traveling salesman problem.

1996

"... In PAGE 32: ... To give an idea of the solution times, the 2392-city problem was solved in approximately 6 hours on a CYBER. As can be seen from Table8 , the lower bounds in the root node are very close to the optimal value which partly explains the success of cutting plane algorithms for the symmetric traveling salesman problem. When solving large instances a very... ..."

Cited by 4

### Table 1: Speedup of TSPLib instances on De Bruijn Networks Let us now watch our computational results. A library of symmetric traveling salesman problem instances known from the literature was provided to us by G. Reinelt [25]. In addition to these instances we generated a set of random euclidean problems. We solved random euclidean problems up to a size of 250 cities. The number in the problem name refers to the size (= number of cities). The problem lin318 was the largest problem from the library, which was solved. Our results were measured on a 1024 Transputer T805 (30 Mhz) processor system. Each processor has 4MB RAM. A Sun Sparc 10 (40 Mhz) is about 16 times faster than one T805 Transputer. Programming language is OCCAM and C. Topologies are con gurable. 13

1995

"... In PAGE 14: ... For a ring we can only achieve good speed-up up to 64 processors. Table1 and 2 show the speedup results on De Bruijn networks. Speed-ups are com- puted dividing sequential time on one transputer by parallel time including all extra work of the parallel implementation.... ..."

Cited by 3

### Table 8: Computational results for the traveling salesman problem.

1996

"... In PAGE 36: ...2 The Traveling Salesman Problem The literature on computational results for the traveling salesman problem is vast, and some of the results have already been shown in Section 3. To make the progress visual, we give in Table8 a list of \world records quot; with respect to the size of the instances. It should be noted that there are still some small instances unsolved, which indicates that small does not necessarily imply easy, and that large is not synonymous with di cult.... In PAGE 36: ... The instances can be found in the library TSPLIB, see Reinelt (1991). Table8 contains information on the number of \cities quot; n of the instances. For all instances a complete graph is assumed which means that the number of variables is equal to 1 2n(n ? 1).... In PAGE 36: ... To give an idea of the solution times, the 2392-city problem was solved in approximately 6 hours on a CYBER. As can be seen from Table8 , the lower bounds in the root node are very close to the optimal value which partly explains the success of cutting plane algorithms for the symmetric traveling salesman problem. When solving large instances a very advanced implementation is necessary, see Applegate et al.... ..."

Cited by 4

### Table 1. Simulation Results on Traveling Salesman Problems

2007

"... In PAGE 4: ... To qualify how much better our proposed algorithm is making shorter routes than the traditional approaches, we have tested all of the algorithms with a large number of Traveling Salesman Problems up to 532 cities and all the simulations are run 10 times, and then compared to several known algorithms: Kohonen Networks [6] [7], a conventional genetic algorithm using a greedy crossover operator [8] [9]. The results of these simulations are summarized in Table1 . The first three columns indicate the problem ... In PAGE 5: ... And the symbol - means no convergence. From Table1 , we can see that the proposed algorithm has superior ability to search the shortest routes and cost less computation times. 5.... ..."

### Table 8. Table of results for the Traveling Salesman Problem.

1994

"... In PAGE 22: ... Ten runs were made for each problem. Table8... ..."

Cited by 10

### Table 1: Computational results for the traveling salesman problem.

1996

"... In PAGE 15: ...perform well in general. To illustrate the progress made by using the polyhedral approach to solve the TSP,we present, in Table1 , the sizes of the largest instances that have been solved to optimality since 1954. Note that the values given in the column z root LP have been rounded to the nearest integer.... ..."

Cited by 4

### Table III. Travelling-salesman problem (execution time in seconds)

1992

Cited by 27

### Table 2. Simulation Results for the Traveling Salesman Problem Number of

1999

Cited by 2