Minimum Recombination Histories by Branch and Bound.
Rune B. LyngsøYun S. SongJotun HeinPublished in: WABI (2005)
Keyphrases
- branch and bound
- branch and bound algorithm
- search algorithm
- lower bound
- search space
- optimal solution
- column generation
- combinatorial optimization
- upper bound
- tree search
- beam search
- branch and bound method
- branch and bound procedure
- randomly generated problems
- network design problem
- tree decomposition
- branch and bound search
- case based reasoning
- tree search algorithm
- integer programming problems
- lagrangian heuristic
- bnb adopt
- max sat
- special case
- np hard
- search strategies
- monte carlo
- constraint satisfaction problems