istresec / kth-aa Goto Github PK
View Code? Open in Web Editor NEWCompetitive 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.
Home Page: https://github.com/m43/kth-aa/blob/main/report.pdf