On semidefinite programming bounds for graph bandwidth

Author： de Klerk Etienne   E.-Nagy Marianna   Sotirov Renata  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.28, Iss.3, 2013-06, pp. : 485-500

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

Embedding methods for semidefinite programming

By Zhang Qinghong  

Optimization Methods and Software, Vol. 27, Iss. 3, 2012-06 ,pp. : 461-482

Taylor & Francis Ltd

Access to resources Recommend Favorite

Optimality Conditions in Semidefinite Programming

By Penot Jean-Paul  

Numerical Functional Analysis and Optimization, Vol. 35, Iss. 7-9, 2014-07 ,pp. : 1174-1196

Taylor & Francis Ltd

Access to resources Recommend Favorite

The trust region subproblem and semidefinite programming

By Fortin Charles   Wolkowicz Henry  

Optimization Methods and Software, Vol. 19, Iss. 1, 2004-02 ,pp. : 41-67

Taylor & Francis Ltd

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

Redundancies in Positive-Semidefinite Quadratic Programming

By Recht P.  

Journal of Optimization Theory and Applications, Vol. 119, Iss. 3, 2003-12 ,pp. : 553-564

Springer Publishing Company

Access to resources Recommend Favorite