Exact Combinatorial Branch-and-Bound for Graph Bisection.
Daniel DellingAndrew V. GoldbergIlya P. RazenshteynRenato Fonseca F. WerneckPublished in: ALENEX (2012)
Keyphrases
- branch and bound
- tree decomposition
- lower bound
- search algorithm
- branch and bound algorithm
- optimal solution
- column generation
- depth first search
- upper bound
- search space
- combinatorial optimization
- vertex set
- tree search algorithm
- beam search
- branch and bound procedure
- randomly generated problems
- tree search
- exact and approximate
- branch and bound method
- graph theory
- exact solution
- linear programming relaxation
- branch and bound search
- lagrangian heuristic
- genetic algorithm
- network design problem
- max sat
- lagrangian relaxation
- spanning tree
- weighted graph
- search methods
- integer programming problems
- previously solved
- constraint satisfaction problems