51 citations · 57 across the 3 of their papers we have counts for
1 paper · 1 filter
Wenhong Tian, Chaojie Huang, Xinyang Wang +1
The traveling salesman problem (TSP) is one of the most challenging NP-hard problems. It has widely applications in various disciplines such as physics, biology, computer science a…