RANDOM TREES AND THE ANALYSIS OF BRANCH AND BOUND PROCEDURES

被引：38

作者：

SMITH, DR

机构：

来源：

JOURNAL OF THE ACM | 1984年 / 31卷 / 01期

关键词：

D O I：

10.1145/2422.322422

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：163 / 188

页数：26

共 37 条

[1] A NOTE ON BRANCH-AND-BOUND PRINCIPLE [J].

BALAS, E .

OPERATIONS RESEARCH, 1968, 16 (02) :442-&

[2] TRAVELING SALESMAN PROBLEM - A SURVEY [J].

BELLMORE, M ;

NEHAUSE.GL .

OPERATIONS RESEARCH, 1968, 16 (03) :538-&

[3] PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS [J].

BELLMORE, M ;

MALONE, JC .

OPERATIONS RESEARCH, 1971, 19 (02) :278-&

[4] BRANCHING FROM LARGEST UPPER BOUND FOLKLORE AND FACTS [J].

FOX, BL ;

LENSTRA, JK ;

RINNOOYKAN, AHG ;

SCHRAGE, LE .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1978, 2 (03) :191-194

[5]

Garey M. R., 1979, COMPUTERS INTRACTIBI

[6]

Garfinkel R. S., 1972, INTEGER PROGRAMMING

[7] PARTITIONING FEASIBLE SET IN A BRANCH-AND-BOUND ALGORITHM FOR ASYMMETRIC TRAVELING-SALESMAN PROBLEM [J].

GARFINKEL, RS .

OPERATIONS RESEARCH, 1973, 21 (01) :340-343

[8] BRANCH SEARCH ALGORITHM FOR KNAPSACK PROBLEM [J].

GREENBERG, H ;

HEGERICH, RL .

MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05) :327-332

[9]

Harris TE., 1963, THEORY BRANCHING PRO

[10] TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES [J].

HELD, M ;

KARP, RM .

OPERATIONS RESEARCH, 1970, 18 (06) :1138-&

← 1 2 3 4 →