A Tight Semidefinite Relaxation of the MAX CUT Problem

Author： Liu Hongwei   Liu Sanyang   Xu Fengmin  

Publisher： Springer Publishing Company

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.7, Iss.3, 2003-09, pp. : 237-245

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

Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

By Rendl Franz  

Mathematical Programming, Vol. 121, Iss. 2, 2010-02 ,pp. : 307-335

Elsevier

Access to resources Recommend Favorite

Randomized Heuristics for the Max-Cut Problem

By Festa P.   Pardalos P.M.   Resende M.G.C.   Ribeiro C.C.  

Optimization Methods and Software, Vol. 17, Iss. 6, 2002-01 ,pp. : 1033-1058

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

A note on semidefinite relaxation for 0-1 quadratic knapsack problems

By Zheng Xiaojin  

Optimization Methods and Software, Vol. 28, Iss. 4, 2013-08 ,pp. : 930-942

Taylor & Francis Ltd

Access to resources Recommend Favorite