Isolation branching: a branch and bound algorithm for the k-terminal cut problem.
Mark VelednitskyDorit S. HochbaumPublished in: J. Comb. Optim. (2022)
Keyphrases
- branch and bound algorithm
- branch and bound
- search tree
- lower bound
- variable ordering
- search algorithm
- upper bound
- randomly generated
- test problems
- optimal solution
- combinatorial optimization
- lower bounding
- precedence constraints
- search space
- randomly generated problems
- column generation
- upper bounding
- mixed integer linear programming
- single machine scheduling problem
- lagrangian relaxation
- np hard
- network design problem
- branch and bound method
- max sat
- release dates