Lower Bounds and Upper Bounds for MaxSAT.
Federico HerasAntónio MorgadoJoão Marques-SilvaPublished in: LION (2012)
Keyphrases
- upper bound
- lower bound
- branch and bound algorithm
- upper and lower bounds
- branch and bound
- lower and upper bounds
- np hard
- worst case
- tight bounds
- objective function
- vc dimension
- upper bounding
- optimal solution
- generalization error
- efficiently computable
- exact solution
- randomly generated
- sample size
- quadratic assignment problem
- lower bounding
- optimal cost
- concept classes
- linear programming relaxation
- linear programming
- randomly generated problems
- lagrangian relaxation
- max sat