Semidefinite relaxations for partitioning, assignment and ordering problems.

Published in: Ann. Oper. Res. (2016)

Keyphrases

semidefinite
semidefinite programming
convex relaxation
interior point methods
higher dimensional
sufficient conditions
evolutionary algorithm
convex optimization
pairwise
dynamic programming
semi supervised
linear programming
optimization methods
solving problems
finite dimensional