Average Case Complexity of Branch-and-Bound Algorithms on Random b-ary Trees.
Adrian KügelPublished in: CTW (2012)
Keyphrases
- branch and bound algorithm
- average case complexity
- lower bound
- randomly generated
- branch and bound
- upper bound
- search tree
- np hard
- average case
- set covering problem
- decision trees
- combinatorial optimization
- finding an optimal solution
- optimal solution
- worst case
- column generation
- lower and upper bounds
- evolutionary algorithm
- max sat
- boolean satisfiability
- objective function
- haplotype inference
- special case
- theoretical analysis