---
title: "Branch-and-Bound and Beyond"
authors:
  - "Patrick A. V. Hall"
doi: ""
url: "https://ijcai.org/proceedings/1971/65"
pdf: "https://ijcai.org/proceedings/1971/0065.pdf"
venue: "Proceedings of the Second International Joint Conference on Artificial Intelligence"
year: 1971
pages: "641-649"
track: ""
keywords:
---

# Branch-and-Bound and Beyond

Patrick A. V. Hall

*Proceedings of the Second International Joint Conference on Artificial Intelligence*, pages 641-649.

## Abstract

The branch-and-bound algorithm is stated in generality, and illustrated by two applications, unidirectional graph search, and reducing a sparse matrix to its minimal band form. The algorithm is then gene ral ised to multiple partitions, a pplied to bidirectional graph searching for both heuristic an d non-he u ristic searches, and further extended to ~ raph s earch es and pro rl em solving with s :Jbgoals.