HEURISTICS AND THEIR DESIGN - A SURVEY

被引:32
作者
MULLERMERBACH, H
机构
关键词
D O I
10.1016/0377-2217(81)90024-2
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:1 / 23
页数:23
相关论文
共 103 条
[31]   APPROXIMATE TRAVELING SALESMAN ALGORITHMS [J].
GOLDEN, B ;
BODIN, L ;
DOYLE, T ;
STEWART, W .
OPERATIONS RESEARCH, 1980, 28 (03) :694-711
[32]   BRANCH SEARCH ALGORITHM FOR KNAPSACK PROBLEM [J].
GREENBERG, H ;
HEGERICH, RL .
MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05) :327-332
[33]  
HANSSMANN F, 1968, OPERATIONS RES TECHN
[34]   TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES [J].
HELD, M ;
KARP, RM .
OPERATIONS RESEARCH, 1970, 18 (06) :1138-&
[35]  
Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]
[36]  
Hildebrandt S., 1977, EUR J OPER RES, V1, P289
[37]  
IGNAZIO JP, 1971, INTERFACES, V2, P8
[38]  
Karp R.M., 1972, COMPLEXITY COMPUTER
[39]   A REVIEW OF ANALYTICAL SYSTEMS OF LINE BALANCING [J].
KILBRIDGE, MD ;
WESTER, L .
OPERATIONS RESEARCH, 1962, 10 (05) :626-638
[40]  
Klein Heinz -Karl, 1971, HEURISTISCHE ENTSCHE