Aura II: Combining Negative Thinking and Branch-and-Bound in Unate Covering Problems.
Luca P. CarloniEvguenii I. GoldbergTiziano VillaRobert K. BraytonAlberto L. Sangiovanni-VincentelliPublished in: VLSI (1999)
Keyphrases
- branch and bound
- branch and bound procedure
- randomly generated problems
- branch and bound algorithm
- search algorithm
- lower bound
- integer programming problems
- branch and bound method
- column generation
- combinatorial optimization
- search space
- network design problem
- optimal solution
- partial solutions
- upper bound
- search methods
- gray level
- tree search
- mixed integer programming
- np complete
- beam search
- depth first search
- linear programming relaxation
- optimization problems
- case based reasoning
- neural network
- previously solved