Is it hopeless to try to compute the shortest route to visit a large number of cities? Not just a good route but the guaranteed shortest. The task is the long-standing challenge known as the traveling ...
This is a preview. Log in through your library . Abstract We consider partitioning algorithms for the approximate solution of large instances of the traveling-salesman problem in the plane. These ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback