A Branch-and-Bound Algorithm to Obtain an Optimal Evaluation Tree for Monotonic Boolean Functions.
Yuri BreitbartAllen ReiterPublished in: Acta Informatica (1975)
Keyphrases
- branch and bound algorithm
- boolean functions
- optimal solution
- randomly generated
- lower bound
- branch and bound
- np hard
- upper bound
- uniform distribution
- precedence constraints
- lower bounding
- worst case
- combinatorial optimization
- upper bounding
- threshold functions
- linear threshold
- mixed integer linear programming
- randomly generated problems
- functional properties
- single machine scheduling problem
- search algorithm
- max sat
- linear programming
- dnf formulae
- membership queries
- multi valued
- search space
- learning algorithm
- multi objective
- evolutionary algorithm