Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.49, Iss.3, 2011-03, pp. : 449-465

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 Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems

By Kuno Takahito

Journal of Global Optimization, Vol. 33, Iss. 2, 2005-10 ,pp. : 215-234

Springer Publishing Company

Access to resources Recommend Favorite

NP-hardness of Euclidean sum-of-squares clustering

By Aloise Daniel

Machine Learning, Vol. 75, Iss. 2, 2009-05 ,pp. : 245-248

Springer Publishing Company

Access to resources Recommend Favorite

A Global Optimization RLT-based Approach for Solving the Fuzzy Clustering Problem

By Sherali Hanif Desai Jitamitra

Journal of Global Optimization, Vol. 33, Iss. 4, 2005-12 ,pp. : 597-615

Springer Publishing Company

Access to resources Recommend Favorite

A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem

By Sherali Hanif Desai Jitamitra

Journal of Global Optimization, Vol. 32, Iss. 2, 2005-06 ,pp. : 281-306

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Bound Algorithm for Concave Network Flow Problems

By Fontes Dalila Hadjiconstantinou Eleni Christofides Nicos

Journal of Global Optimization, Vol. 34, Iss. 1, 2006-01 ,pp. : 127-155

Springer Publishing Company

Access to resources Recommend Favorite