.png){kind=icon}
.png){kind=icon}
Return
Semidefinite relaxations for partitioning, assignment and ordering problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-015-2015-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Semidefinite optimization is a strong tool in the study of NP-hard combinatorial optimization problems. On the one hand, semidefinite optimization problems are in principle solvable in polynomial time (with fixed precision), on the other hand, their modeling power allows to naturally handle quadratic constraints. Contrary to linear optimization with the efficiency of the Simplex method, the algorithmic treatment of semidefinite problems is much more subtle and also practically quite expensive. This survey-type article is meant as an introduction for a non-expert to this exciting area. The basic concepts are explained on a mostly intuitive level, and pointers to advanced topics are given. We provide a variety of semidefinite optimization models on a selection of graph optimization problems and give a flavour of their practical impact.
Keywords:
Semidefinite optimization
Partitioning problem
Ordering problem
Assignment problem
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W