An asynchronous multiprocessor design for branch-and-bound algorithms
暂无分享,去创建一个
Q. Wang | K. H. Cheng | K. Cheng | Q. Wang
[1] T. N. Mudge,et al. Parallel branch and bound algorithms on hypercube multiprocessors , 1989, C3P.
[2] Benjamin W. Wah,et al. Coping with Anomalies in Parallel Branch-and-Bound Algorithms , 1986, IEEE Transactions on Computers.
[3] Ellis Horowitz,et al. Fundamentals of Computer Algorithms , 1978 .
[4] Kam-Hoi Cheng. A Simultaneous Access Queue , 1990, J. Parallel Distributed Comput..
[5] Zhenqiang Fan,et al. A Simultaneous Access Priority Queue , 1989, ICPP.
[6] Vivek Sarkar,et al. Processor Scheduling Algorithms for Constraint-Satisfaction Search Problems , 1988, ICPP.
[7] Sartaj Sahni,et al. Anomalies in Parallel Branch-and-Bound Algorithms , 1984 .
[8] Ehud D. Karnin,et al. A Parallel Algorithm for the Knapsack Problem , 1984, IEEE Transactions on Computers.
[9] K. Schwan,et al. Process and workload migration for a parallel branch-and-bound algorithm on a hypercube multicomputer , 1989, C3P.
[10] Wing H. Huen,et al. Distributed Enumeration on Between Computers , 1980, IEEE Transactions on Computers.
[11] Benjamin W. Wah,et al. MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems , 1984, IEEE Transactions on Computers.