Algorithmic Approaches in Travelling Salesman Problem or Any NP-Hard Problems

I am interested in exploring algorithmic strategies for NP-Hard problems, with a particular focus on the Travelling Salesman Problem (TSP) and its variants. My research vision is to study approximation algorithms, heuristic methods, and hybrid approaches that balance theoretical rigor with computational efficiency. By leveraging tools from graph theory, computational geometry, and optimization, I aim to design scalable methods that can handle complex real-world problem instances. I welcome collaborations with researchers working on theoretical computer science, combinatorial optimization, and algorithm design to advance this area.