Branch-and-Bound Solves Random Binary Packing IPs in Polytime.
Santanu S. DeyYatharth DubeyMarco MolinaroPublished in: CoRR (2020)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- branch and bound algorithm
- upper bound
- search space
- column generation
- optimal solution
- combinatorial optimization
- branch and bound method
- randomly generated problems
- beam search
- tree search
- branch and bound procedure
- network design problem
- tree search algorithm
- search strategies
- packing problem
- multi valued
- linear programming relaxation
- branch and bound search
- reduce the search space
- knowledge compilation
- heuristic search
- lagrangian heuristic