HEURISTIC SEARCH UNDER CONDITIONS OF ERROR

被引：37

作者：

HARRIS, LR ^{[1
]}

机构：

[1] DARTMOUTH COLL, DEPT MATH, HANOVER, NJ 03755 USA

来源：

ARTIFICIAL INTELLIGENCE | 1974年 / 5卷 / 03期

关键词：

D O I：

10.1016/0004-3702(74)90014-9

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：217 / 234

页数：18

共 13 条

[1]

BERLINER HJ, 1973, 3RD P INT JOINT C AR, P77

[2] ADMISSIBLE AND OPTIMAL ALGORITHM FOR SEARCHING AND/OR GRAPHS [J].

CHANG, CL ;

SLAGLE, JR .

ARTIFICIAL INTELLIGENCE, 1971, 2 (02) :117-128

[3] A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS [J].

CROES, GA .

OPERATIONS RESEARCH, 1958, 6 (06) :791-812

[4]

HARRIS LR, 1972, TR133 CORN U COMP SC

[5] A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS [J].

HART, PE ;

NILSSON, NJ ;

RAPHAEL, B .

IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02) :100-+

[6] BRANCH-AND-BOUND METHODS - A SURVEY [J].

LAWLER, EL ;

WOOD, DE .

OPERATIONS RESEARCH, 1966, 14 (04) :699-+

[7]

LIN S, 1972, 1 BELL TEL LAB COMP

[8] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM [J].

LITTLE, JDC ;

MURTY, KG ;

SWEENEY, DW ;

KAREL, C .

OPERATIONS RESEARCH, 1963, 11 (06) :972-989

[9]

Nilsson N.J., 1971, PROBLEM SOLVING METH

[10] HEURISTIC SEARCH VIEWED AS PATH FINDING IN A GRAPH [J].

POHL, I .

ARTIFICIAL INTELLIGENCE, 1970, 1 (03) :193-204

← 1 2 →