Lower bounds on the size of general branch-and-bound trees.
Santanu S. DeyYatharth DubeyMarco MolinaroPublished in: Math. Program. (2023)
Keyphrases
- branch and bound
- lower bound
- upper bound
- branch and bound algorithm
- search algorithm
- randomly generated problems
- optimal solution
- column generation
- branch and bound method
- special case
- tree search
- branch and bound procedure
- search space
- combinatorial optimization
- beam search
- objective function
- np hard
- search strategies
- network design problem
- bounded degree
- partial solutions
- linear programming relaxation
- search strategy
- branch and bound search
- linear programming
- genetic algorithm
- cutting plane
- traveling salesman problem
- monte carlo
- tree search algorithm
- lagrangian heuristic