Cutting planes for semidefinite relaxations based on triangle-free subgraphs.
Abraham BermanMirjam DürNaomi Shaked-MondererJulia WitzelPublished in: Optim. Lett. (2016)
Keyphrases
- semidefinite
- cutting plane
- semidefinite programming
- integer programming
- lower bound
- column generation
- convex relaxation
- interior point methods
- knapsack problem
- sufficient conditions
- integer program
- linear programming relaxation
- mixed integer
- linear program
- valid inequalities
- higher dimensional
- linear programming
- convex sets
- upper bound
- optimal solution