Parallel branch and bound on fine-grained hypercube multiprocessors-Reference-Cited by-同舟云学术

Parallel branch and bound on fine-grained hypercube multiprocessors

Published:1990-09 Issue:1-3 Volume:15 Page:201-209
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Dehne Frank,Ferreira Afonso G,Rau-Chaplin Andrew

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference16 articles.

1. Parallel branch and bound algorithms on the hypercube;Anderson,1987

2. Parallel branch and bound algorithms on hypercube multiprocessors;Abdelrahman,1988

3. Best-first branch and bound on a hypercube;Felten,1988

4. S.R. Huang and L.S. Davis, Parallel iterative A∗ search: an admissible distributed heuristic search algorith, Internat. Joint Conf. on Artificial Interlligence 89, Preprint.

5. Coping with anomalies in parallel branch and bound algorithms;Li;IEEE Trans. on Comput.,1986

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel algorithms for a multi-level network optimization problem;Parallel Algorithms and Applications;2003-09

2. Parallel processing for difficult combinatorial optimization problems;European Journal of Operational Research;1996-08

3. Parallel Branch-and-Branch Algorithms: Survey and Synthesis;Operations Research;1994-12

4. A massively parallel knowledge-base server using a hypercube multiprocessor;Parallel Computing;1994-09

5. A bibliography of heuristic search research through 1992;IEEE Transactions on Systems, Man, and Cybernetics;1994