Dynamic programming treatment of the traveling salesman problem.
$15.00
{{option.name}}:
{{selected_options[option.position]}}
{{value_obj.value}}
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...
Show More
Show Less