Branch and Bound ?

newbie · Post by **newbie** » Mon May 19, 2003 4:19 pm

Any one tells me where i can get documents about that ? Is "Branch and Bound" a method of screening some stupid cases of exhaustive search ?

Diskerr · Post by **Diskerr** » Tue May 20, 2003 9:33 am

Foundations of Algorithms Using C++ Pseudocode, Second Edition
by Richard E. Neapolitan, Kumarss Naimipour

It has a chapter related to branch and bound.

Yes.. branch and bound is more efficient method to prune unpromissing nodes than backtracking in exhaustive search..