Semidefinite Programming Based Algorithms for the Sparsest Cut Problem

Author： Meira Luis A.A.   Miyazawa Flávio K.  

Publisher： Edp Sciences

E-ISSN： 1290-3868|45|2|75-100

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.45, Iss.2, 2011-06, pp. : 75-100

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

Kernel-function Based Algorithms for Semidefinite Optimization

By EL Ghami M.   Bai Y. Q.   Roos C.  

RAIRO - Operations Research, Vol. 43, Iss. 2, 2009-04 ,pp. : 189-199

Edp Sciences

Access to resources Recommend Favorite

On the central path for nonlinear semidefinite programming

By Grana Drummond L. M.   Iusem Alfredo Noel   Svaiter B. F.  

RAIRO - Operations Research, Vol. 34, Iss. 3, 2010-03 ,pp. : 331-345

Edp Sciences

Access to resources Recommend Favorite

A logarithm barrier method for semi-definite programming

By Crouzeix Jean-Pierre   Merikhi Bachir  

RAIRO - Operations Research, Vol. 42, Iss. 2, 2008-05 ,pp. : 123-139

Edp Sciences

Access to resources Recommend Favorite

A relaxed logarithmic barrier method for semidefinite programming

By Samia Kettab   Djamel Benterki  

RAIRO - Operations Research, Vol. 49, Iss. 3, 2015-02 ,pp. : 555-568

Edp Sciences

Access to resources Recommend Favorite

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem

By Kerivin Hervé   Lacroix Mathieu   Quilliot Alain   Toussaint Hélène  

RAIRO - Operations Research, Vol. 45, Iss. 3, 2011-10 ,pp. : 179-207

Edp Sciences

Access to resources Recommend Favorite