BRANCH-AND-BOUND PROCEDURE AND STATE-SPACE REPRESENTATION OF COMBINATORIAL OPTIMIZATION PROBLEMS

被引：19

作者：

IBARAKI, T

机构：

来源：

INFORMATION AND CONTROL | 1978年 / 36卷 / 01期

关键词：

D O I：

10.1016/S0019-9958(78)90197-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1 / 27

页数：27

共 24 条

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

BALAS, E .

[2]

Booth T. L., 1967, SEQUENTIAL MACHINES

[3]

HART PE, 1968, IEEE T SYS SCI CYBER, V4, P100, DOI DOI 10.1109/TSSC.1968.300136

[4] COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS [J].

IBARAKI, T .

[5] REPRESENTATION THEOREMS FOR EQUIVALENT OPTIMIZATION PROBLEMS [J].

IBARAKI, T .

INFORMATION AND CONTROL, 1972, 21 (05) :397-435

IBARAKI, T .

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

[7] SOLVABLE CLASSES OF DISCRETE DYNAMIC PROGRAMMING [J].

IBARAKI, T .

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

IBARAKI, T .

[9] FINITE-STATE PROCESSES AND DYNAMIC PROGRAMMING [J].

KARP, RM ;

HELD, M .

[10]

Knuth D. E., 1969, ART COMPUTER PROGRAM, V1