A semidefinite programming approach to the hypergraph minimum bisection problem

ISSN： 0233-1934

Source： Optimization, Vol.60, Iss.3, 2011-01, pp. : 413-427

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem

By Krishnan Kartik Mitchell John

Computational Optimization and Applications, Vol. 33, Iss. 1, 2006-01 ,pp. : 51-71

Springer Publishing Company

Access to resources Recommend Favorite

On semidefinite programming relaxations for the satisfiability problem

By Anjos Miguel F.

Mathematical Methods of Operations Research, Vol. 60, Iss. 3, 2004-12 ,pp. : 349-367

Springer Publishing Company

Access to resources Recommend Favorite

Lower-Order Penalization Approach to Nonlinear Semidefinite Programming

By Huang X. Yang X. Teo K.

Journal of Optimization Theory and Applications, Vol. 132, Iss. 1, 2007-01 ,pp. : 1-20

Springer Publishing Company

Access to resources Recommend Favorite

Exterior Minimum-Penalty Path-Following Methods in Semidefinite Programming

By Fan M.K.H. Gong Y.

Journal of Optimization Theory and Applications, Vol. 100, Iss. 2, 1999-02 ,pp. : 327-348

Springer Publishing Company

Access to resources Recommend Favorite

Approximating the 2-catalog segmentation problem using semidefinite programming relaxations

By Xu Dachuan Ye Yinyu Zhang Jiawei

Optimization Methods and Software, Vol. 18, Iss. 6, 2003-12 ,pp. : 705-719

Taylor & Francis Ltd

Access to resources Recommend Favorite