Back to search

Parallel Branch-and-Bound Formulations for AND/OR Tree Search

Data up to Jan 2025

Published1984
Citations83
References36

Total Citations Per Year

Abstract

References (36)

Combinatorial optimization:Algorithms and complexity

1984 • 3,523 citations

Branch-and-Bound Methods: A Survey

1966 • 1,915 citations

Problem-Solving Methods in Artificial Intelligence

1971 • 1,638 citations

An analysis of alpha-beta pruning

1975 • 956 citations

Principles of Artificial Intelligence

1981 • 931 citations

Algorithms and Complexity: New Directions and Recent Results

1976 • 411 citations

Branch-and-Bound Methods: General Formulation and Properties

1970 • 328 citations

Anomalies in parallel branch-and-bound algorithms

1984 • 251 citations

The B∗ tree search algorithm: A best-first proof procedure

1979 • 189 citations

A minimax algorithm better than alpha-beta?

1979 • 183 citations

Cm*

1977 • 181 citations

Asymptotic properties of minimax trees and game-searching procedures

1980 • 160 citations

Parallel Search of Strongly Ordered Game Trees

1982 • 159 citations

Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

1974 • 111 citations

The Power of Dominance Relations in Branch-and-Bound Algorithms

1977 • 107 citations

The design and analysis of algorithms for asynchronous multiprocessors.

1978 • 92 citations

A general branch and bound formulation for understanding and synthesizing and/or tree search procedures

1983 • 87 citations

Cm* - A modular, multi-microprocessor

1899 • 84 citations

General Branch and Bound, and its relation to A∗ and AO∗

1984 • 82 citations

Parallelism in alpha-beta search

1982 • 78 citations

Problem-Solving Models and Search Strategies for Pattern Recognition

1979 • 77 citations

Distributed Enumeration on Between Computers

1980 • 70 citations

A minimax algorithm better than alpha-beta? Yes and No

1983 • 53 citations

Design, Analysis, and Implementation of a Parallel Tree Search Algorithm

1982 • 50 citations

Branch-and-bound procedure and state—space representation of combinatorial optimization problems

1978 • 46 citations

Experience with Two Parallel Programs Solving the Traveling Salesman Problem.

1983 • 41 citations

Equivalence between AND/OR graphs and context-free grammars

1973 • 36 citations

A problem-reduction approach to the linguistic analysis of waveforms.

1977 • 28 citations

Problem Reduction Representation for the Linguistic Analysis of Waveforms

1983 • 26 citations

Improved Speedup Bounds for Parallel Alpha-Beta Search

1983 • 19 citations

A parallel searching scheme for multiprocessor systems and its application to combinatorial problems

1979 • 19 citations

MANIP-a parallel computer system for implementing branch and bound algorithms

1981 • 19 citations

A unified approach to problem solving search procedures

1982 • 14 citations

Heuristic Search Programs

1970 • 12 citations

Errata

1971 • 7 citations

Parallel implementations of a structural analysis algorithm.

1981 • 7 citations

Cited By (0)

Loading...