Compressing Branch-and-Bound Trees.
Gonzalo MuñozJoseph PaatÁlinson S. XavierPublished in: IPCO (2023)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- branch and bound algorithm
- upper bound
- optimal solution
- search space
- column generation
- combinatorial optimization
- search strategies
- branch and bound method
- tree search
- beam search
- max sat
- branch and bound procedure
- branch and bound search
- data compression
- tree structure
- tree search algorithm
- depth first search
- linear programming relaxation
- network design problem
- tree decomposition
- randomly generated problems
- lagrangian heuristic
- bayesian networks