Abstract: In order to solve the NP hard problem of TSP problem, this paper proposes the C-N-GA (Christofides Algorithm& Nearby Measures & Genetic Algorithm) algorithm that combines the Christofides ...
A classical algorithm is tested against D-Wave hybrid quantum annealers for special cases of the Traveling Salesman Problem where the weights of the edges in a graph form an arithmetic progression.
The traveling salesman problem is one of the basic problems that many theoretical computer scientists have been working on. Many scientists think that there is no algorithm for the traveling salesman ...
Add a description, image, and links to the christofides-algorithm topic page so that developers can more easily learn about it.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results