{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T15:55:48Z","timestamp":1772294148326,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1007\/s10589-005-4565-7","type":"journal-article","created":{"date-parts":[[2005,5,11]],"date-time":"2005-05-11T08:39:58Z","timestamp":1115800798000},"page":"147-160","source":"Crossref","is-referenced-by-count":31,"title":["Efficient Algorithms for the Smallest Enclosing Ball Problem"],"prefix":"10.1007","volume":"30","author":[{"given":"Guanglu","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim-Chuan","family":"Tohemail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR1","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"R.H. Byrd","year":"1995","unstructured":"R.H. Byrd, P. Lu, J. Nocedal, and C. Zhu, \u201cA limited memory algorithm for bound constrained optimization\u201d SIAM J. Sci. Comput., vol. 16, pp. 1190\u20131208, 1995.","journal-title":"SIAM J. Sci. Comput"},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR2","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1287\/mnsc.19.1.96","volume":"19","author":"J. Elzinga","year":"1972","unstructured":"J. Elzinga and D. Hearn, \u201cThe minimum covering sphere problem\u201d Management Sci., vol. 19, pp. 96\u2013104, 1972.","journal-title":"Management Sci"},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR3","doi-asserted-by":"crossref","unstructured":"Bn. G\u00e4rter, \u201cFast and robust smallest enclosing balls\u201d in Algorithms-ESA\u201999: 7th Annual European Symposium Proceedings, J. Nestril (Ed.), Lecture Notes in Computer Science 1643, Springer-Verlag, pp. 325\u2013338.","DOI":"10.1007\/3-540-48481-7_29"},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR4","unstructured":"B. G\u00e4rter, Smallest enclosing ball\u2014Fast and robust in C++, http:\/\/www.inf.ethz.ch\/personal\/gaertner\/miniball.html."},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR5","unstructured":"G.H. Hardy, J.E. Littlewood, and G. Polya, Inequalities. Cambridge University Press, 1952."},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR6","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1287\/opre.30.4.777","volume":"30","author":"D.W. Hearn","year":"1982","unstructured":"D.W. Hearn and J. Vijan, \u201cEfficient algorithms for the minimum circle problem\u201d Oper. Res., vol. 30, pp. 777\u2013795, 1982.","journal-title":"Oper. Res."},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR7","volume-title":"Convex Analysis and Minimization Algorithm","author":"J.B. Hiriart-Urruty","year":"1993","unstructured":"J.B. Hiriart-Urruty and C. Lemarechal, Convex Analysis and Minimization Algorithm. Springer-Verlag: Berlin, Heidelberg, 1993."},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR8","first-page":"1467","volume":"34","author":"X.S. Li","year":"1991","unstructured":"X.S. Li, \u201cAn aggregate function method for nonlinear programming\u201d Sci. China Ser. A, vol. 34, pp. 1467\u20131473, 1991.","journal-title":"Sci. China Ser. A"},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR9","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, \u201cLinear-time algorithms for linear programming in \u211c3 and related problems\u201d SIAM J. Comput., vol. 12, pp. 759\u2013776, 1983.","journal-title":"SIAM J. Comput."},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Polynomial Algorithms in Convex Programming","author":"Yu. E. Nesterov","year":"1994","unstructured":"Yu. E. Nesterov and A. Nemirovskii, Interior Polynomial Algorithms in Convex Programming. SIAM: Philadelphia, 1994."},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"Yu. E. Nesterov","year":"1997","unstructured":"Yu. E. Nesterov and M.J. Todd, \u201cSelf-scaled barriers and interior-point methods for convex programming\u201d Math. Oper. Res., vol. 22, pp. 1\u201342, 1997.","journal-title":"Math. Oper. Res"},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction, Texts and Monographs in Computer Science","author":"F.P. Preparata","year":"1985","unstructured":"F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Texts and Monographs in Computer Science, Springer-Verlag: New York, 1985."},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/SFCS.1975.8","volume-title":"16th Annual Symposium on Foundations of Computer Science (Berkeley, CA, 1975)","author":"M.I. Shamos","year":"1975","unstructured":"M.I. Shamos and D. Hoey, \u201cClosest-point problems\u201d in 16th Annual Symposium on Foundations of Computer Science (Berkeley, CA, 1975), IEEE Computer Society, Long Beach, CA, 1975, pp. 151\u2013162."},{"issue":"12","key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR14","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J.F. Sturm","year":"1999","unstructured":"J.F. Sturm, \u201cUsing SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones\u201d Optim. Methods Softw., vol. 11 & 12, pp. 625\u2013653, 1999.","journal-title":"Optim. Methods Softw."},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR15","doi-asserted-by":"crossref","unstructured":"P. Sun and R.M. Freund, \u201cComputation of minimum volume covering ellipsoids\u201d MIT Operations Research Center Working Paper OR 064-02, July, 2002.","DOI":"10.2139\/ssrn.321262"},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR16","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"R.H T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"R.H T\u00fct\u00fcnc\u00fc, K.C. Toh, and M.J. Todd, \u201cSolving semidefinite-quadratic-linear programs using SDPT3\u201d Math. Programming, vol. 95, pp. 189\u2013217, 2003.","journal-title":"Math. Programming"},{"issue":"12","key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR17","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/10556789908805760","volume":"11","author":"R.J. Vanderbei","year":"1999","unstructured":"R.J. Vanderbei, \u201cLOQO user\u2019s manual\u2014version 3.10\u201d Optim. Methods Softw., vol. 11 & 12, pp. 485\u2013514, 1999.","journal-title":"Optim. Methods Softw."},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR18","doi-asserted-by":"crossref","unstructured":"E. Welzl, \u201cSmallest enclosing disks (balls and ellipsoids)\u201d in New Results and New Trends in Computer Science, H. Maurer (Ed.) Springer-Verlag, 1991, pp. 359\u2013370.","DOI":"10.1007\/BFb0038202"},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR19","unstructured":"D. White, Enclosing ball software, http:\/\/vision.ucsd.edu\/~dwhite\/ball.html."},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR20","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/A:1022977709811","volume":"25","author":"S. Xu","year":"2003","unstructured":"S. Xu, R. Freund, and J. Sun, \u201cSolution methodologies for the smallest enclosing circle problem,\u201cComput. Optim. Appl.,\u201d vol. 25, pp. 283\u2013292, 2003.","journal-title":"Comput. Optim. Appl."},{"key":"techbooks_nopdfdoi_2005-05-09_09-40-39_CR21","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1137\/S1052623495288362","volume":"7","author":"G.L. Xue","year":"1997","unstructured":"G.L. Xue and Y.Y. Ye, \u201cAn efficient algorithm for minimizing a sum of Euclidean norms with applications\u201d SIAM J. Optim., vol. 7, pp. 1017\u20131036, 1997.","journal-title":"SIAM J. Optim"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-4565-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-4565-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-4565-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T08:57:54Z","timestamp":1586249874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-4565-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["4565"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-4565-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}