On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs.
Max GläserMarc E. PfetschPublished in: IPCO (2022)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- upper bound
- search space
- column generation
- combinatorial optimization
- optimal solution
- branch and bound procedure
- computational complexity
- randomly generated problems
- network design problem
- lagrangian heuristic
- worst case
- search strategies
- branch and bound method
- beam search
- linear programming relaxation
- tree search
- tree search algorithm
- branch and bound search
- max sat
- partial solutions
- depth first search
- graphical models
- lagrangian relaxation
- space complexity
- shortest path