ANALYSIS OF A PREFERENCE ORDER TRAVELING SALESMAN PROBLEM

被引：19

作者：

SNIEDOVICH, M

机构：

来源：

OPERATIONS RESEARCH | 1981年 / 29卷 / 06期

关键词：

D O I：

10.1287/opre.29.6.1234

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Application is made to the preference order dynamic programming solution procedure proposed by E. P. C. 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.

引用

页码：1234 / 1237

页数：4