Branch-and-bound solves random binary IPs in poly(n)-time.
Santanu S. DeyYatharth DubeyMarco MolinaroPublished in: Math. Program. (2023)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- branch and bound algorithm
- column generation
- upper bound
- optimal solution
- search space
- combinatorial optimization
- branch and bound method
- tree search
- branch and bound procedure
- randomly generated problems
- beam search
- tree search algorithm
- network design problem
- depth first search
- max sat
- branch and bound search
- search strategies
- np hard
- cutting plane
- lagrangian relaxation
- neural network
- satisfiability problem