The Traveling Salesman Problem (TSP) is a prototypical NP-hard combinatorial optimisation challenge: given a set of locations and pairwise distances satisfying the triangle inequality, find the ...

Combinatorial optimization underpins applications in artificial intelligence, logistics, and network design, yet classical techniques such as greedy search and dynamic programming struggle to balance ...