The article elaborates on the mathematical formulation of the traveling salesman problem (TSP), presenting it as an integer linear programming problem or a graph-theoretical model, and discusses its computational complexity, highlighting the TSP’s classification as an NP-hard problem, which underscores the inherent difficulty in finding an optimal solution as the number of cities increases.