A C++ implementation of the Christofides algorithm for instances in TSPLIB format
Implementation of various algorithms to solve sTSP: D.P. Held–Karp algorithm, Held–Karp MST algorithm, Volgenant–Jonker 1-tree relaxation, Christofides algorithm. It includes: Kruskal algorithm, Prim algorithm, Blossom algorithm.
Competitive C++ solution to the Travelling Salesperson 2D problem, that includes the implementation of 6 algorithms: greedy, Clarke-Wright, Christofides, 2-opt, 3-opt, and Lin-Kernighan (k-opt). Done as part of the project assignment in the *DD22440 Advanced Algorithms* course at KTH, by Prof. Danupon Nanongkai.
Add a description, image, and links to the christofides-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the christofides-algorithm topic, visit your repo's landing page and select "manage topics."