LK-Heuristic TSP
Implements the Lin-Kernighan Heuristic for solving the Travelling Salesman Problem
Problem 1 of Heuristic Problem Solving at NYU
Team: Codebreakers
- Abhinav Tamaskar ([email protected])
- Lingliang Zhang ([email protected])
Step 1
Compile Code
g++ LKMain.cpp LKMatrix.cpp -o LKSolver
Step 2
Run Code
./exec.sh <input_file> out.tsp
With Timing
./run_program ./exec.sh <input_file> out.tsp