Efficient Branch and Bound Search with Application to Computer-Aided Design /

Branch-and-bound search has been known for a long time and has been widely used in solving a variety of problems in computer-aided design (CAD) and many important optimization problems. In many applications, the classic branch-and-bound search methods perform duplications of computations, or rely on...

Full description

Bibliographic Details
Main Author: Chen, Xinghao
Corporate Author: SpringerLink (Online service)
Other Authors: Bushnell, Michael L.
Format: eBook
Language:English
Published: Boston, MA : Springer US, 1996.
Series:Frontiers in electronic testing ; 4.
Subjects:
Online Access:Connect to the full text of this electronic book

Similar Items