Early Estimates of the Size of Branch-and-Bound Trees.
Gérard CornuéjolsMiroslav KaramanovYanjun LiPublished in: INFORMS J. Comput. (2006)
Keyphrases
- branch and bound
- search algorithm
- lower bound
- branch and bound algorithm
- search space
- optimal solution
- upper bound
- column generation
- combinatorial optimization
- branch and bound method
- tree search
- randomly generated problems
- tree search algorithm
- linear programming relaxation
- branch and bound procedure
- search strategies
- beam search
- depth first search
- lagrangian heuristic
- network design problem
- game tree
- max sat
- simulated annealing
- bnb adopt
- dynamic programming