.png){kind=icon}
返回
Semidefinite programs and association schemes
.png){kind=icon}
PRE
AI
DOI：10.1007/s006070050038.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme.
Keyword:
semidefinite programming
association scheme
maximum cut problem
