Solution of a Large-Scale Traveling-Salesman Problem
$15.00
{{option.name}}:
{{selected_options[option.position]}}
{{value_obj.value}}
It is shown that a certain tour of 49 cities, one in each of the 48 states and Washington, D. C. has the shortest road distance.
Show More
Show Less