| Article ID: | iaor19921126 |
| Country: | Switzerland |
| Volume: | 33 |
| Start Page Number: | 379 |
| End Page Number: | 402 |
| Publication Date: | Dec 1991 |
| Journal: | Annals of Operations Research |
| Authors: | Rayward-Smith V.J., McKeown G.P., Turpin H.J. |
| Keywords: | computational analysis |
The branch-and-bound paradigm is presented as a higher-order function and illustrated by instantiations, providing two well-known branch-and-bound algorithms for the Steiner tree problem in graphs and one for the travelling salesman problem. The authors discuss the advantages of such a specification and various issues arising from sequential and parallel implementations of branch-and-bound kernels.