Abstract
Application is made to the preference order dynamic programming solution procedure proposed by Kao for a stochastic traveling salesman problem. Although the procedure is flawed from the myopic interpretation of the monotonicity condition, it may be used as a convenient heuristic tool for solving stochastic problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
