Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems.
Adam KurpiszSamuli LeppänenMonaldo MastrolilliPublished in: ACM Trans. Comput. Theory (2024)
Keyphrases
- lower bound
- optimization problems
- objective function
- upper bound
- evolutionary algorithm
- branch and bound
- cost function
- branch and bound algorithm
- metaheuristic
- optimal solution
- np hard
- lower bounding
- worst case
- lower and upper bounds
- average case complexity
- optimization methods
- traveling salesman problem
- knapsack problem
- upper and lower bounds
- lagrangian relaxation
- ant colony optimization
- multi objective
- optimal cost
- combinatorial optimization
- generalization error
- hamming distance
- simulated annealing
- quadratic assignment problem
- constant factor
- neural network