An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs

Author： Pham Dinh Tao   Nguyen Canh Nam   Le Thi Hoai  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.48, Iss.4, 2010-12, pp. : 595-632

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

A new efficient algorithm based on DC programming and DCA for clustering

By An Le   Belghiti M.   Tao Pham  

Journal of Global Optimization, Vol. 37, Iss. 4, 2007-04 ,pp. : 593-608

Springer Publishing Company

Access to resources Recommend Favorite

Convex relaxation for solving posynomial programs

By Lu Hao-Chun   Li Han-Lin   Gounaris Chrysanthos   Floudas Christodoulos  

Journal of Global Optimization, Vol. 46, Iss. 1, 2010-01 ,pp. : 147-154

Springer Publishing Company

Access to resources Recommend Favorite

Decomposition Methods for Solving Nonconvex Quadratic Programs via Branch and Bound*

By Cambini Riccardo   Sodini Claudio  

Journal of Global Optimization, Vol. 33, Iss. 3, 2005-11 ,pp. : 313-336

Springer Publishing Company

Access to resources Recommend Favorite

B-spline Method for Solving General Singularly Perturbed Boundary Value Problems Using Fitted Mesh

By Kadalbajoo M.K.   Aggarwal Vivek K.  

Computing Letters, Vol. 2, Iss. 4, 2006-11 ,pp. : 193-203

VSP

Access to resources Recommend Favorite

Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm

By Etoa Jean  

Journal of Global Optimization, Vol. 47, Iss. 4, 2010-08 ,pp. : 615-637

Springer Publishing Company

Access to resources Recommend Favorite