Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems.
Adam KurpiszSamuli LeppänenMonaldo MastrolilliPublished in: ICALP (2016)
Keyphrases
- lower bound
- optimization problems
- objective function
- upper bound
- branch and bound
- evolutionary algorithm
- branch and bound algorithm
- cost function
- np hard
- worst case
- metaheuristic
- lower and upper bounds
- statistical queries
- optimal solution
- average case complexity
- optimization methods
- lower bounding
- lagrangian relaxation
- non binary
- set of randomly generated instances
- traveling salesman problem
- combinatorial optimization
- quadratic assignment problem
- optimal cost
- randomly generated problems
- vc dimension
- upper and lower bounds
- max sat
- multi objective
- special case
- polynomial approximation
- similarity measure
- neural network