Solution of a Large-Scale Traveling-Salesman Problem

Solution of a Large-Scale Traveling-Salesman Problem

Regular price $15.00 $15.00 Sale

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.