Cutting Planes for Mixed 0-1 Semidefinite Programs.
Garud IyengarMehmet Tolga ÇezikPublished in: IPCO (2001)
Keyphrases
- semidefinite
- cutting plane
- semidefinite programming
- cutting plane algorithm
- integer programming
- column generation
- integer program
- mixed integer
- convex relaxation
- lower bound
- higher dimensional
- knapsack problem
- interior point methods
- sufficient conditions
- convex sets
- convex optimization
- feature space
- tabu search
- finite dimensional