{"type":"ScholarlyArticle","title":"Branch-and-Bound and Beyond","authors":[{"name":"Patrick A. V. Hall","slug":"patrick-a-v-hall","given":"Patrick A. V.","family":"Hall","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1971/65","pdf":"https://ijcai.org/proceedings/1971/0065.pdf","markdown":"https://ijcai.org/proceedings/1971/65.md","bibtex":"https://ijcai.org/proceedings/1971/bibtex/65","volume":{"slug":"1971","title":"Proceedings of the Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1971","url":"https://ijcai.org/proceedings/1971/","year":1971,"location":"London, UK","dates":"","editors":"D.C. Cooper","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":65,"pages":{"first":641,"last":649},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}