Approximating the 2-catalog segmentation problem using semidefinite programming relaxations

Author： Xu Dachuan   Ye Yinyu   Zhang Jiawei  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

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

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

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

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

Interest rate model calibration using semidefinite Programming

By D'Aspremont A.  

Applied Mathematical Finance, Vol. 10, Iss. 3, 2003-09 ,pp. : 183-213

Routledge Ltd

Access to resources Recommend Favorite