A stronger LP bound for formula size lower bounds via clique constraints.
Kenya UenoPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- optimal solution
- branch and bound algorithm
- objective function
- worst case
- np hard
- linear programming
- integer programming formulations
- constant factor
- running times
- maximum clique
- branch and bound
- vc dimension
- mixed integer
- optimal cost
- linear program
- upper and lower bounds
- linear arithmetic constraints
- linear constraints
- valid inequalities
- linear programming relaxation
- lagrangian relaxation
- concept classes
- approximation algorithms
- cutting plane
- integer program
- computational complexity
- search space
- constraint satisfaction
- constraint programming
- primal dual
- knapsack problem
- integer programming