Clustering via minimum volume ellipsoids

By Shioda Romy   Tunçel Levent  

Computational Optimization and Applications, Vol. 37, Iss. 3, 2007-07 ,pp. : 247-295

Springer Publishing Company

Access to resources Recommend Favorite

Rank-two update algorithms for the minimum volume enclosing ellipsoid problem

By Cong Wei-jie   Liu Hong-wei   Ye Feng   Zhou Shui-sheng  

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 241-257

Springer Publishing Company

Access to resources Recommend Favorite

On Equations of Ellipsoids Approximating Attainable Sets

By Ovseevich A.I.  

Journal of Optimization Theory and Applications, Vol. 95, Iss. 3, 1997-12 ,pp. : 659-676

Springer Publishing Company

Access to resources Recommend Favorite

Enclosing a Set of Objects by Two Minimum Area Rectangles

By Becker B.   Franciosa P.G.   Gschwind S.   Leonardi S.   Ohler T.   Widmayer P.  

Journal of Algorithms, Vol. 21, Iss. 3, 1996-11 ,pp. : 520-541

Academic Press

Access to resources Recommend Favorite

Vertices contained in all minimum paired-dominating sets of a tree

By Chen Xue-gang  

Czechoslovak Mathematical Journal, Vol. 57, Iss. 1, 2007-03 ,pp. : 407-417

Springer Publishing Company

Access to resources Recommend Favorite