Implementation of several heuristics and optimizations for solving the euclidian tsp problem. This was inspired by the assignment in the course of DD2440 Advance Algorithms at KTH Royal Institute of Technology
- Greedy Algorithm
- Nearest Insertion
- Nearest Neighbour
- 2-opt
- 2-opt + Node Insertion
- Lin Kernighan (simplified)
- Simulated Annealing