Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
Crossref DOI link: https://doi.org/10.1007/s10878-014-9798-x
Published Online: 2014-09-27
Published Print: 2016-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chang, Yanming
Peng, Yuejian
Yao, Yuping
Text and Data Mining valid from 2014-09-27