Can anyone recommend a reference which shows the amount of time required for the Traveling Salesman Problem (TSP) to be solved using brute force as the number of cities increase?
I have informally heard that a computer can not solve the TSP for more than 8 cities using brute force; and after 8 cities, the run time for the TSP becomes in years.
I am very curious to see a reference where a table is given that shows how long a computer takes to solve the TSP for a different number of cities, and then shows the estimated amount of time to find exact solutions as the number of cities grows to around 15 cities.
Can anyone please recommend something?
Note: I found something like this https://www.sciencedirect.com/topics/earth-and-planetary-sciences/traveling-salesman-problem ... but I would be interested in knowing how the time estimates are calculated.