Dynamic programming treatment of the traveling salesman problem.

Dynamic programming treatment of the traveling salesman problem.

Regular price $15.00 $12.00 Sale

A discussion of the well-known traveling salesman problem: "A salesman is required to visit each of n different cities, starting from a base city and returning to this city. What path minimizes the total distance traveled by the salesman?" It is show...