Negative thinking in branch-and-bound: the case of unate covering.
Evguenii I. GoldbergLuca P. CarloniTiziano VillaRobert K. BraytonAlberto L. Sangiovanni-VincentelliPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2000)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- branch and bound algorithm
- optimal solution
- column generation
- search space
- combinatorial optimization
- upper bound
- branch and bound procedure
- max sat
- randomly generated problems
- search strategies
- branch and bound method
- tree search algorithm
- beam search
- network design problem
- integer programming problems
- lagrangian heuristic
- branch and bound search
- linear programming relaxation
- tree search
- multi agent
- np hard
- heuristic search