DEPTH-M SEARCH IN BRANCH-AND-BOUND ALGORITHMS

被引：7

作者：

IBARAKI, T

机构：

来源：

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES | 1978年 / 7卷 / 04期

关键词：

D O I：

10.1007/BF00991818

中图分类号：

G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];

学科分类号：

1205 ; 120501 ;

摘要：

引用

页码：315 / 343

页数：29

共 11 条

[1]

Agin N., 1966, MANAGE SCI, V13, pB176

[2] FLEXIBLE ENUMERATION SCHEME FOR ZERO-ONE PROGRAMMING [J].

ELLWEIN, LB .

[3] ACCELERATING LIST PROCESSING IN DISCRETE PROGRAMMING [J].

FOX, BL .

IBARAKI, T .

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1976, 5 (04) :315-344

[5]

Knuth Donald E, 1968, ART COMPUTER PROGRAM, V1

KOHLER, WH ;

STEIGLIT.K .

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

LAWLER, EL ;

WOOD, DE .

[8] BRANCH-AND-BOUND METHODS - GENERAL FORMULATION AND PROPERTIES [J].

MITTEN, LG .

[9]

Nilsson N.J., 1971, PROBLEM SOLVING METH

[10]

OHKAWA T, 1976, THESIS KYOTO U