Combining Semidefinite and Polyhedral Relaxations for Integer Programs.
Christoph HelmbergSvatopluk PoljakFranz RendlHenry WolkowiczPublished in: IPCO (1995)
Keyphrases
- semidefinite
- integer program
- convex sets
- lipschitz continuity
- semidefinite programming
- linear program
- column generation
- interior point methods
- integer programming
- convex relaxation
- cutting plane
- sufficient conditions
- higher dimensional
- linear programming
- convex hull
- finite number
- primal dual
- finite dimensional
- valid inequalities
- linear programming relaxation