equal
deleted
inserted
replaced
570 - \ref GreedyTsp Greedy algorithm |
570 - \ref GreedyTsp Greedy algorithm |
571 - \ref InsertionTsp Insertion heuristic (with four selection methods) |
571 - \ref InsertionTsp Insertion heuristic (with four selection methods) |
572 - \ref ChristofidesTsp Christofides algorithm |
572 - \ref ChristofidesTsp Christofides algorithm |
573 - \ref Opt2Tsp 2-opt algorithm |
573 - \ref Opt2Tsp 2-opt algorithm |
574 |
574 |
|
575 \ref NearestNeighborTsp, \ref GreedyTsp, and \ref InsertionTsp are the fastest |
|
576 solution methods. Furthermore, \ref InsertionTsp is usually quite effective. |
|
577 |
|
578 \ref ChristofidesTsp is somewhat slower, but it has the best guaranteed |
|
579 approximation factor: 3/2. |
|
580 |
|
581 \ref Opt2Tsp usually provides the best results in practice, but |
|
582 it is the slowest method. It can also be used to improve given tours, |
|
583 for example, the results of other algorithms. |
|
584 |
575 \image html tsp.png |
585 \image html tsp.png |
576 \image latex tsp.eps "Traveling salesman problem" width=\textwidth |
586 \image latex tsp.eps "Traveling salesman problem" width=\textwidth |
577 */ |
587 */ |
578 |
588 |
579 /** |
589 /** |