COIN-OR::LEMON - Graph Library

Changeset 1204:dff32ce3db71 in lemon for doc


Ignore:
Timestamp:
01/09/11 15:06:55 (9 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Make InsertionTsp? much faster and improve docs (#386)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r1202 r1204  
    573573 - \ref Opt2Tsp 2-opt algorithm
    574574
     575\ref NearestNeighborTsp, \ref GreedyTsp, and \ref InsertionTsp are the fastest
     576solution methods. Furthermore, \ref InsertionTsp is usually quite effective.
     577
     578\ref ChristofidesTsp is somewhat slower, but it has the best guaranteed
     579approximation factor: 3/2.
     580
     581\ref Opt2Tsp usually provides the best results in practice, but
     582it is the slowest method. It can also be used to improve given tours,
     583for example, the results of other algorithms.
     584
    575585\image html tsp.png
    576586\image latex tsp.eps "Traveling salesman problem" width=\textwidth
Note: See TracChangeset for help on using the changeset viewer.