Basis Reduction, and the Complexity of Branch-and-Bound
Gábor PatakiMustafa Kemal TuralPublished in: CoRR (2009)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- column generation
- search space
- upper bound
- combinatorial optimization
- optimal solution
- branch and bound procedure
- tree search
- branch and bound method
- branch and bound search
- network design problem
- search strategies
- beam search
- tree search algorithm
- randomly generated problems
- lagrangian heuristic
- partial solutions
- space complexity
- worst case
- depth first search
- computational complexity
- search strategy
- integer programming problems
- state space