TSP - Travelling Salesman Problem

Introduction I will talk about P vs NP, NP-complete, and NP-hard, define heuristics in computer science, Hamiltonian cycles, TSP and Metric TSP, approximation algorithms, and optimal vs suboptimal solutions. I will also mention local minima, combinatorial explosion, and why exact solutions become infeasible. Finally, we will see an optimal solution and also an approximation algorithm. I’ll also discuss the limitations of the chosen approximation algorithm, what could be improved, and mention oth