A Branch and Bound for the Large Live Parsimony Problem.
Rogério GüthsGuilherme P. TellesMaria Emília M. T. WalterNalvo F. AlmeidaPublished in: BIOINFORMATICS (2017)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- branch and bound algorithm
- search space
- combinatorial optimization
- optimal solution
- upper bound
- column generation
- branch and bound procedure
- beam search
- branch and bound method
- randomly generated problems
- linear programming relaxation
- network design problem
- tree decomposition
- branch and bound search
- search strategies
- max sat
- tree search algorithm
- integer programming problems
- lagrangian heuristic
- heuristic search
- depth first search
- tree search
- np hard
- linear programming
- constraint satisfaction problems
- traveling salesman problem