Lin-Kernighan-Heuristic-approach-to-solving-TSP The LK Heuristic is used to solve the Traveling Salesman Problem. Step 1 Compile Code g++ LKMain.cpp LKMatrix.cpp -o LKSolver Step 2 Run Code ./exec.sh <input_file> out.tsp