Anzeige
Erschienen in:
1996 | OriginalPaper | Buchkapitel
Introduction
verfasst von : Xinghao Chen, Michael L. Bushnell
Erschienen in: Efficient Branch and Bound Search with Application to Computer-Aided Design
Verlag: Springer US
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Branch-and-bound search is a general form of enumerative schemes for solving problems for which direct solution methods either do not exist or are inefficient. It is based on the fact that, in general, only a small number of the possible solutions need actually be enumerated. The remaining possible solutions are eliminated through the applications of bounds which reflect constraints. It can also be viewed as structured search in the space containing all feasible solutions in the sense that, in the worst case, all possible solutions have to be enumerated.