POWER OF DOMINANCE RELATIONS IN BRANCH-AND-BOUND ALGORITHMS

被引：59

作者：

IBARAKI, T ^{[1
]}

机构：

[1] KYOTO UNIV,FAC ENGN,DEPT APPL MATH & PHYS,KYOTO 606,JAPAN

来源：

关键词：

D O I：

10.1145/322003.322010

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：264 / 279

页数：16

共 33 条

[1] Agin N., 1966, MANAGE SCI, V13, pB176
[2] MERGING AND SORTING APPLIED TO ZERO-ONE KNAPSACK PROBLEM
AHRENS, JH
FINKE, G
[J]. OPERATIONS RESEARCH, 1975, 23 (06) : 1099 - 1109
[3] A NOTE ON BRANCH-AND-BOUND PRINCIPLE
BALAS, E
[J]. OPERATIONS RESEARCH, 1968, 16 (02) : 442 - &
[4] Bellman R., 1957, DYNAMIC PROGRAMMING
[5] Conway R, 1967, THEORY SCHEDULING
[6] Dijkstra E., 1959, NUMER MATH, V1, P269
[7] DREYFUS SE, 1969, OPER RES, V17, P394
[8] ELMAGHRABY SE, 1968, J IND ENGINEERING, V19, P105
[9] Fillmore J. P., 1974, SIAM Journal on Computing, V3, P41, DOI 10.1137/0203004
[10] Fox B., 1966, MANAGE SCI, V13, P210