Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs.
Pravesh KothariRaghu MekaPrasad RaghavendraPublished in: CoRR (2016)
Keyphrases
- lower bound
- lp relaxation
- optimal solution
- integrality gap
- constraint satisfaction problems
- linear programming
- np hard
- upper bound
- learning theory
- message passing
- linear program
- knapsack problem
- search space
- branch and bound
- branch and bound algorithm
- integer programming
- arc consistency
- objective function
- constraint satisfaction
- integer program
- feasible solution
- global constraints
- linear programming relaxation
- constraint propagation
- lower and upper bounds
- integer programming formulation
- worst case
- energy minimization
- exact solution
- cutting plane
- search algorithm
- lagrangian relaxation
- np complete
- valid inequalities
- dynamic programming
- optimization problems
- energy function