ANOMALIES IN PARALLEL BRANCH-AND-BOUND ALGORITHMS

被引：119

作者：

LAI, TH ^{[1
]}

SAHNI, S ^{[1
]}

机构：

[1] UNIV MINNESOTA,DEPT COMP SCI,MINNEAPOLIS,MN 55455

来源：

关键词：

D O I：

10.1145/358080.358103

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：594 / 602

页数：9

共 16 条

[1]

AGIN N, MANAGE SCI, V13, pB176

[2]

DESAI B, 1978, P ICS 78, P802

[3]

DESAI B, 1977, THESIS MCGILL U

[4]

DESAI B, 1979, 1979 P INT C PAR PRO

[5]

ELDESSOUKI OI, 1980, IEEE T COMPUT, V29, P818, DOI 10.1109/TC.1980.1675681

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

FOX, BL ;

LENSTRA, JK ;

RINNOOYKAN, AHG ;

SCHRAGE, LE .

[7] BOUNDS ON MULTIPROCESSING TIMING ANOMALIES [J].

GRAHAM, RL .

[8]

Harris J. A., 1977, 4th Annual Symposium on Computer Architecture, P41

[9]

Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]

[10]

Horowitz E., 1978, FUNDAMENTALS COMPUTE