Branch-and-Bound and Beyond

Hall, Patrick A. V.

Branch-and-Bound and Beyond

Download BibTeX Cite

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.

Patrick A. V. Hall. 1971. Branch-and-Bound and Beyond. In Proceedings of the Second International Joint Conference on Artificial Intelligence, IJCAI-71. IJCAI, 641–649. https://ijcai.org/proceedings/1971/65

@inproceedings{ijcai1971p65,
  title     = {Branch-and-Bound and Beyond},
  author    = {Hall, Patrick A. V.},
  booktitle = {Proceedings of the Second International Joint Conference on
               Artificial Intelligence, {IJCAI-71}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {D.C. Cooper},
  pages     = {641--649},
  year      = {1971},
  url       = {https://ijcai.org/proceedings/1971/65},
}

TY  - CPAPER
TI  - Branch-and-Bound and Beyond
AU  - Hall, Patrick A. V.
T2  - Proceedings of the Second International Joint Conference on Artificial Intelligence, IJCAI-71
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1971
SP  - 641
EP  - 649
UR  - https://ijcai.org/proceedings/1971/65
ER  -