GENERAL BRANCH AND BOUND, AND ITS RELATION TO A-STAR AND AO-STAR

被引：29

作者：

NAU, DS

KUMAR, V

KANAL, L

机构：

来源：

ARTIFICIAL INTELLIGENCE | 1984年 / 23卷 / 01期

关键词：

D O I：

10.1016/0004-3702(84)90004-3

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：29 / 58

页数：30

共 26 条

[1] B-STAR TREE SEARCH ALGORITHM - BEST-1ST PROOF PROCEDURE [J].

BERLINER, H .

ARTIFICIAL INTELLIGENCE, 1979, 12 (01) :23-40

[2]

HALL PAV, 1971, 2ND P INT JOINT C AR, P641

[3]

Horowitz E., 1978, FUNDAMENTALS COMPUTE

[4] POWER OF DOMINANCE RELATIONS IN BRANCH-AND-BOUND ALGORITHMS [J].

IBARAKI, T .

JOURNAL OF THE ACM, 1977, 24 (02) :264-279

[5] BRANCH-AND-BOUND PROCEDURE AND STATE-SPACE REPRESENTATION OF COMBINATORIAL OPTIMIZATION PROBLEMS [J].

IBARAKI, T .

INFORMATION AND CONTROL, 1978, 36 (01) :1-27

[6] OPTIMALITY OF ALGORITHMS FOR FINITE STATE SEQUENTIAL DECISION-PROCESSES [J].

IBARAKI, T .

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1976, 53 (03) :618-643

[7] ANALYSIS OF ALPHA-BETA PRUNING [J].

KNUTH, DE ;

MOORE, RW .

ARTIFICIAL INTELLIGENCE, 1975, 6 (04) :293-326

[8] CHARACTERIZATION AND THEORETICAL COMPARISON OF BRANCH-AND-BOUND ALGORITHMS FOR PERMUTATION PROBLEMS [J].

KOHLER, WH ;

STEIGLIT.K .

JOURNAL OF THE ACM, 1974, 21 (01) :140-156

[9]

KOHLER WH, 1976, COMPUTER JOB SHOP SC

[10] A GENERAL BRANCH AND BOUND FORMULATION FOR UNDERSTANDING AND SYNTHESIZING AND OR TREE-SEARCH PROCEDURES [J].

KUMAR, V ;

KANAL, LN .

ARTIFICIAL INTELLIGENCE, 1983, 21 (1-2) :179-198

← 1 2 3 →