Question: 1. a. Assuming that each tour can be generated in constant time, what will be the efficiency class of the exhaustive-search algorithm outlined in the

1. a. Assuming that each tour can be generated in constant time, what will be the efficiency class of the exhaustive-search algorithm outlined in the text for the traveling salesman problem? b. If this algorithm is programmed on a computer that makes ten billion additions per second, estimate the maximum number of cities for which the problem can be solved in i. 1 hour. ii. 24 hours. iii. 1 year. iv. 1 century
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
