Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation.
Max GläserMarc E. PfetschPublished in: SODA (2024)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- upper bound
- column generation
- optimal solution
- search algorithm
- randomly generated problems
- branch and bound method
- search space
- network design problem
- branch and bound procedure
- tree search algorithm
- lower and upper bounds
- combinatorial optimization
- max sat
- tree search
- linear programming relaxation
- average case complexity
- beam search
- np hard
- special case
- depth first search
- branch and bound search
- worst case
- lagrangian heuristic
- objective function
- cutting plane
- mixed integer programming
- lagrangian relaxation
- optimization problems