A PROBABILISTIC ANALYSIS OF THE SWITCHING ALGORITHM FOR THE EUCLIDEAN TSP

被引：16

作者：

KERN, W

机构：

来源：

关键词：

D O I：

10.1007/BF01587089

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：213 / 219

页数：7

共 7 条

BONOMI, E ;

LUTTON, JL .

[2]

Karp R.M., 1976, ALGORITHMS COMPLEXIT, P85

[3]

Lawler E. L., 1985, TRAVELING SALESMAN P

[4]

LIEBLING TM, 1985, RO851125 DEP MATH EP

[5] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM [J].

LIN, S ;

KERNIGHAN, BW .

[6] SOME EXAMPLES OF DIFFICULT TRAVELING SALESMAN PROBLEMS [J].

PAPADIMITRIOU, CH ;

STEIGLITZ, K .

[7] ON THE NUMBER OF ITERATIONS OF LOCAL IMPROVEMENT ALGORITHMS [J].

TOVEY, CA .