Lower Bounds on the Size of General Branch-and-Bound Trees.
Santanu S. DeyYatharth DubeyMarco MolinaroPublished in: CoRR (2021)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- upper bound
- search algorithm
- optimal solution
- column generation
- randomly generated problems
- search space
- branch and bound method
- combinatorial optimization
- tree search
- special case
- linear programming relaxation
- beam search
- branch and bound procedure
- tree search algorithm
- network design problem
- objective function
- search strategies
- depth first search
- worst case
- max sat
- lower and upper bounds
- np hard
- multi agent
- partial solutions
- branch and bound search
- integer programming problems
- neural network