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

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

Publisher： Springer Publishing Company

ISSN： 0926-6003

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

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

Efficient Algorithms for the Smallest Enclosing Ball Problem

By Zhou Guanglu   Tohemail Kim-Chuan   Sun Jie  

Computational Optimization and Applications, Vol. 30, Iss. 2, 2005-02 ,pp. : 147-160

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

Minimum-Volume Enclosing Ellipsoids and Core Sets

By Kumar P.   Yildirim E.  

Journal of Optimization Theory and Applications, Vol. 126, Iss. 1, 2005-07 ,pp. : 1-21

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Parallel Algorithms for the Minimum Cost Flow Problem

By Beraldi P.   Guerriero F.   Musmanno R.  

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

Springer Publishing Company

Access to resources Recommend Favorite

Two Variations of the Minimum Steiner Problem

By Hsu Tsan-Sheng   Tsai Kuo-Hui   Wang Da-Wei   Lee D.  

Journal of Combinatorial Optimization, Vol. 9, Iss. 1, 2005-02 ,pp. : 101-120

Springer Publishing Company

Access to resources Recommend Favorite