Ivan Stresec*, Frano Rajič*
Project report | Problem definition
Codebase contains a competitive C++ solution with 6 algorithms implemented: greedy, Clarke-Wright, Christofides, 2-opt, 3-opt, and Lin-Kernighan (k-opt). Solved as part of the project assignment in the DD22440 Advanced Algorithms course at KTH, by Prof. Danupon Nanongkai.
Problem from kth.kattis.com: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?
Consult the CMakeLists.txt file as well as the src/main.cpp, to get started.