Teaching Note - Using the Maximum Clique Problem to Motivate Branch-and-Bound.
Dawn M. StricklandPublished in: INFORMS Trans. Educ. (2008)
Keyphrases
- branch and bound
- branch and bound algorithm
- lower bound
- search algorithm
- optimal solution
- upper bound
- column generation
- search space
- combinatorial optimization
- tree search algorithm
- tree search
- branch and bound search
- branch and bound procedure
- search strategies
- branch and bound method
- search tree
- randomly generated problems
- beam search
- max sat
- tree decomposition
- network design problem
- depth first search
- integer programming problems
- lagrangian heuristic
- linear programming relaxation
- partial solutions
- mixed integer programming
- convex hull
- graphical models