Travelling salesman problem
Heuristic and approximation algorithms

Various heuristics and approximation algorithms, which quickly yield good solutions, have been devised. These include the multi-fragment algorithm. Modern methods can find solutions for extremely large problems (millions of cities) within a reasonable time which are, with a high probability, just 2–3% away from the optimal solution.

Several categories of heuristics are recognized.
keywords:letter_frequency