1.1 --- a/doc/groups.dox Sun Jan 09 00:57:12 2011 +0100
1.2 +++ b/doc/groups.dox Sun Jan 09 15:06:55 2011 +0100
1.3 @@ -572,6 +572,16 @@
1.4 - \ref ChristofidesTsp Christofides algorithm
1.5 - \ref Opt2Tsp 2-opt algorithm
1.6
1.7 +\ref NearestNeighborTsp, \ref GreedyTsp, and \ref InsertionTsp are the fastest
1.8 +solution methods. Furthermore, \ref InsertionTsp is usually quite effective.
1.9 +
1.10 +\ref ChristofidesTsp is somewhat slower, but it has the best guaranteed
1.11 +approximation factor: 3/2.
1.12 +
1.13 +\ref Opt2Tsp usually provides the best results in practice, but
1.14 +it is the slowest method. It can also be used to improve given tours,
1.15 +for example, the results of other algorithms.
1.16 +
1.17 \image html tsp.png
1.18 \image latex tsp.eps "Traveling salesman problem" width=\textwidth
1.19 */