Technical Note—Analysis of a Preference Order Traveling Salesman Problem
Operations Research · 1981 · Volume 29 · Issue 6
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.
Keywords
111 preference order traveling salesman problem
Enable JavaScript for citation tools and additional paper interactions.