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 ...
This is a preview. Log in through your library . Abstract Application is made to the preference order dynamic programming solution procedure proposed by Kao for a stochastic traveling salesman problem ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback