Parallel branch and bound algorithms on hypercube multiprocessors

被引：2

|

作者：

Abdelrahman, T.S.

Mudge, T.N.

机构：

来源：

Conference on Hypercube Concurrent Computers and Applications | 1988年

关键词：

D O I：

10.1145/63047.63106

中图分类号：

学科分类号：

摘要：

引用

下载

收藏

相关论文

共 50 条

[41] Performance study of parallel algorithms on hypercube multicomputer
Lin, Yaping
Hunan Daxue Xuebao/Journal of Hunan University Natural Sciences, 1995, 22 (05):
[42] Are Branch and Bound and A* Algorithms Identical?
Jean-Marc Labat
Jean-Charles Pomerol
Journal of Heuristics, 2003, 9 : 131 - 143
[43] Are branch and bound and A* algorithms identical?
Labat, JM
Pomerol, JC
JOURNAL OF HEURISTICS, 2003, 9 (02) : 131 - 143
[44] PARALLEL SORTING ALGORITHMS FOR TIGHTLY COUPLED MULTIPROCESSORS
QUINN, MJ
PARALLEL COMPUTING, 1988, 6 (03) : 349 - 357
[45] Two branch-and-bound algorithms for the robust parallel machine scheduling problem
Ranjbar, Mohammad
Davari, Morteza
Leus, Roel
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (07) : 1652 - 1660
[46] Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures
Sanjuan-Estrada, J. F.
Casado, L. G.
Garcia, I.
JOURNAL OF SUPERCOMPUTING, 2011, 58 (03): : 376 - 384
[47] Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures
J. F. Sanjuan-Estrada
L. G. Casado
I. García
The Journal of Supercomputing, 2011, 58 : 376 - 384
[48] DESIGN OF PARALLEL ALGORITHMS FOR A DISTRIBUTED MEMORY HYPERCUBE
ZAPATA, EL
PLATA, OG
RIVERA, FF
MICROPROCESSORS AND MICROSYSTEMS, 1992, 16 (09) : 463 - 470
[49] Optimal parallel hypercube algorithms for polygon problems
Atallah, Mikhail J., 1600, IEEE, Los Alamitos, CA, United States (44):
[50] OPTIMAL PARALLEL HYPERCUBE ALGORITHMS FOR POLYGON PROBLEMS
ATALLAH, MJ
CHEN, DZ
IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (07) : 914 - 922

← 1 2 3 4 5 →