Decision versions of optimization problems: cardinality constraint (lower bound) as a CNF Horn formula for Matching and Clique.
Prabhu ManyemPublished in: CoRR (2014)
Keyphrases
- lower bound
- cardinality constraints
- optimization problems
- horn theories
- functional dependencies
- objective function
- np hard
- upper bound
- evolutionary algorithm
- cost function
- knowledge compilation
- conjunctive normal form
- metaheuristic
- optimal solution
- cnf formula
- database design
- logical formulas
- worst case
- branch and bound
- branch and bound algorithm
- knapsack problem
- boolean functions
- database
- entity relationship
- integrity constraints
- linear programming
- partial order
- traveling salesman problem
- combinatorial optimization
- boolean formula
- np complete
- data sources