Parallel processing of combinatorial search trees
- 1 January 1987
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functionsInformation Processing Letters, 1986
- Performance of parallel branch-and-bound algorithmsIEEE Transactions on Computers, 1985
- Parallel Branch-and-Bound Formulations for AND/OR Tree SearchIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984
- A comparison of minimax tree search algorithmsArtificial Intelligence, 1983
- Improved Speedup Bounds for Parallel Alpha-Beta SearchIEEE Transactions on Pattern Analysis and Machine Intelligence, 1983
- Parallelism in alpha-beta searchArtificial Intelligence, 1982
- Design, Analysis, and Implementation of a Parallel Tree Search AlgorithmIEEE Transactions on Pattern Analysis and Machine Intelligence, 1982
- An analysis of alpha-beta pruningArtificial Intelligence, 1975
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971