HOW EASY IS LOCAL SEARCH

被引：367
作者：
JOHNSON, DS
PAPADIMITRIOU, CH
YANNAKAKIS, M
机构：
[1] STANFORD UNIV,STANFORD,CA 94305
[2] NATL TECH UNIV ATHENS,GR-147 ATHENS,GREECE
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1988年 / 37卷 / 01期
关键词：
D O I：
10.1016/0022-0000(88)90046-3
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：79 / 100
页数：22
相关论文
共 12 条
[1]  
Garey MR., 1979, COMPUTERS INTRACTABI
[2]  
Goldschlager L. M., 1977, SIGACT News, V9, P25, DOI 10.1145/1008354.1008356
[3]  
JOHNSON DS, IN PRESS NEAR OPTIMA
[4]  
Kernighan B., 1972, BELL SYST TECH J, V49, P291
[5]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[6]  
KNUTH DE, 1984, UNPUB
[7]   EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM [J].
LIN, S ;
KERNIGHAN, BW .
OPERATIONS RESEARCH, 1973, 21 (02) :498-516
[8]  
Lueker G., 1976, UNPUB
[9]  
Papadimitriou C. H., 1998, COMBINATORIAL OPTIMI
[10]   SOME EXAMPLES OF DIFFICULT TRAVELING SALESMAN PROBLEMS [J].
PAPADIMITRIOU, CH ;
STEIGLITZ, K .
OPERATIONS RESEARCH, 1978, 26 (03) :434-443
12