A depth-first branch-and-bound algorithm for optimal PLA folding.
Werner GrassPublished in: DAC (1982)
Keyphrases
- branch and bound algorithm
- branch and bound
- optimal solution
- search tree
- lower bound
- upper bound
- test problems
- np hard
- lower bounding
- precedence constraints
- search algorithm
- combinatorial optimization
- randomly generated problems
- single machine scheduling problem
- branch and bound method
- column generation
- upper bounding
- worst case
- dynamic programming
- knapsack problem
- lagrangian relaxation
- linear program
- search space
- maximum clique
- objective function
- max sat
- search strategy
- mixed integer linear programming
- variable ordering