An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem.
Adam KurpiszSamuli LeppänenMonaldo MastrolilliPublished in: Math. Program. (2017)
Keyphrases
- polynomially solvable
- integrality gap
- np hard
- np complete
- linear programming relaxation
- feasible solution
- special case
- approximation algorithms
- minimum cost
- processing times
- np hardness
- lower bound
- valid inequalities
- lp relaxation
- linear program
- linear programming
- knapsack problem
- arbitrarily close
- worst case
- scheduling problem
- primal dual
- reinforcement learning
- approximation guarantees
- lagrangian relaxation
- network flow
- column generation
- tabu search
- optimal solution
- objective function
- lower and upper bounds
- randomly generated
- distributed systems
- cost function
- low degree
- integer programming formulation
- image segmentation