Parallel processing of combinatorial search trees

This publication has 18 references indexed in Scilit:

• A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions
  Information Processing Letters, 1986
• Performance of parallel branch-and-bound algorithms
  IEEE Transactions on Computers, 1985
• Parallel Branch-and-Bound Formulations for AND/OR Tree Search
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1984
• Anomalies in parallel branch-and-bound algorithms
  Communications of the ACM, 1984
• A comparison of minimax tree search algorithms
  Artificial Intelligence, 1983
• Improved Speedup Bounds for Parallel Alpha-Beta Search
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Parallelism in alpha-beta search
  Artificial Intelligence, 1982
• Design, Analysis, and Implementation of a Parallel Tree Search Algorithm
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• An analysis of alpha-beta pruning
  Artificial Intelligence, 1975
• The traveling-salesman problem and minimum spanning trees: Part II
  Mathematical Programming, 1971