Branch-and-Bound Solves Random Binary IPs in Polytime.
Santanu S. DeyYatharth DubeyMarco MolinaroPublished in: SODA (2021)
Keyphrases
- branch and bound
- search algorithm
- branch and bound algorithm
- lower bound
- search space
- upper bound
- column generation
- optimal solution
- combinatorial optimization
- tree search
- beam search
- network design problem
- branch and bound procedure
- branch and bound method
- randomly generated problems
- max sat
- tree search algorithm
- integer programming problems
- lagrangian heuristic
- linear programming relaxation
- branch and bound search
- search tree
- dynamic programming
- multi valued
- search strategies
- optimization problems
- multi agent
- neural network