Branch-and-Bound Solution to TSP
Richard L. Wiener · Apress eBooks · 2022
The previous chapter introduced the famed Travelling Salesperson Problem (TSP). A brute-force solution was presented. Like all exact solutions to this problem, it is computationally intractable. A third-party package was presented along with code for graphically displaying a TSP tour.