Publications related to 'branch and bound' : Branch-and-bound is a general algorithm for finding optimal solutions of various optimization problems, which consists of a systematic enumeration of all candidate solutions, where large subsets of fruitless candidates are discarded en masse, by using upper and lower estimated bounds of the quantity being optimized. (Wikipedia)
Order by:   Type | Year
           related to:
Associated keywords
Rune Lyngsø, Yun S. Song and Jotun Hein. Minimum Recombination Histories by Branch and Bound. In WABI05, Vol. 3692:239-250 of LNCS, springer, 2005.
Keywords: ARG, branch and bound, from sequences, minimum number, Program Beagle, recombination, reconstruction, software.