论文信息 - Parallel Branch and Bound Method Using Systematic Shuffling - 字舞流文

Parallel Branch and Bound Method Using Systematic Shuffling

Fuminori Kobayashi | Shinji Hara | Hitoshi Kondoh | Nobuo Takehira | S. Hara | N. Takehira | F. Kobayashi | H. Kondoh

[1] Benjamin W. Wah,et al. Multiprocessing of Combinatorial Search Problems , 1985, Computer.

[2] Benjamin W. Wah,et al. Coping with Anomalies in Parallel Branch-and-Bound Algorithms , 1986, IEEE Transactions on Computers.

[3] C. V. Ramamoorthy,et al. Optimal Scheduling Strategies in a Multiprocessor System , 1972, IEEE Transactions on Computers.

[4] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

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

[6] Robert G. Babb,et al. Parallel Processing with Large-Grain Data Flow Techniques , 1984, Computer.

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

[8] Boontee Kruatrachue,et al. Grain size determination for parallel processing , 1988, IEEE Software.

[9] J. Y. S. LUH,et al. Scheduling of Parallel Computation for a Computer-Controlled Mechanical Manipulator , 1982, IEEE Transactions on Systems, Man, and Cybernetics.