Estimating the Size of Branch-and-Bound Trees.
Gregor HendelDaniel AndersonPierre Le BodicMarc E. PfetschPublished in: INFORMS J. Comput. (2022)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- search space
- upper bound
- column generation
- optimal solution
- combinatorial optimization
- branch and bound method
- beam search
- randomly generated problems
- network design problem
- partial solutions
- branch and bound procedure
- tree search algorithm
- computational complexity
- lower and upper bounds
- neural network
- tree search
- integer programming problems
- branch and bound search
- lagrangian heuristic
- approximation algorithms
- optimization problems
- np hard
- objective function