Abstract
The efficient branch-and-bound search method we have described in this book has the following advantages:
-
It can guarantee absolutely no duplication of computation in a branch-and-bound search.
-
It does not depend on a specific search decision tree.
-
It can be used to augment various existing search heuristics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Chen, X., Bushnell, M.L. (1996). Conclusion. In: Efficient Branch and Bound Search with Application to Computer-Aided Design. Frontiers in Electronic Testing, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1329-8_10
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1329-8_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8571-7
Online ISBN: 978-1-4613-1329-8
eBook Packages: Springer Book Archive