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 ...

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 ...