Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem.
Mark VelednitskyDorit S. HochbaumPublished in: COCOA (2018)
Keyphrases
- branch and bound algorithm
- branch and bound
- search tree
- lower bound
- variable ordering
- search algorithm
- optimal solution
- upper bound
- lower bounding
- randomly generated
- combinatorial optimization
- column generation
- test problems
- np hard
- randomly generated problems
- lagrangian relaxation
- branch and bound method
- max sat
- precedence constraints
- search space
- upper bounding
- single machine scheduling problem
- network design problem
- maximum clique