L

lin-kernighan

Symmetric Travelling Salesman Problem with multiple starting cities (C++). Cities are divided into sectors (angular split, clustering, random split), and in each sector the route is found with the Lin-Kernighan metaheuristic. Combinatorial Optimization course project.