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

On Semidefinite Programming Relaxations of (2+ p )-SAT

By de Klerk E.  

Annals of Mathematics and Artificial Intelligence, Vol. 37, Iss. 3, 2003-03 ,pp. : 285-305

Springer Publishing Company

Access to resources Recommend Favorite

From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems

By Roupin Frédéric  

Journal of Combinatorial Optimization, Vol. 8, Iss. 4, 2004-12 ,pp. : 469-493

Springer Publishing Company

Access to resources Recommend Favorite

A semidefinite programming approach to the hypergraph minimum bisection problem

By Choi Changhui  

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

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