论文信息 - Implementing Branch-and-Bound in a Ring of Processors - 字舞流文

Implementing Branch-and-Bound in a Ring of Processors

A set of personal computers is connected to form a ring structured parallel system: Each processor has access to its local memory and can exchange messages with its two ring neighbors.

Oliver Vornberger | O. Vornberger

[1] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[2] B. Monien,et al. The ring machine , 1987 .

[3] Sartaj Sahni,et al. Anomalies in Parallel Branch-and-Bound Algorithms , 1984 .

[4] Benjamin W. Wah,et al. MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems , 1984, IEEE Transactions on Computers.

[5] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[6] Oliver Vornberger,et al. Superlinear Speedup for Parallel Backtracking , 1987, ICS.

[7] Udi Manber,et al. DIB—a distributed implementation of backtracking , 1987, TOPL.

[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .