Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition.
Ilse FischerGerald GruberFranz RendlRenata SotirovPublished in: Math. Program. (2006)
Keyphrases
- semidefinite
- cutting plane
- integer programming
- lower bound
- semidefinite programming
- column generation
- convex relaxation
- knapsack problem
- sufficient conditions
- interior point methods
- mixed integer
- linear programming
- integer program
- higher dimensional
- linear program
- upper bound
- convex sets
- np hard
- valid inequalities
- genetic algorithm
- linear programming relaxation
- maximum likelihood
- special case
- learning algorithm