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 ...
After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem. When Nathan Klein started graduate school two years ago, his ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback