{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:58:16Z","timestamp":1775181496140,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1023\/a:1022977709811","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:16:51Z","timestamp":1049739411000},"page":"283-292","source":"Crossref","is-referenced-by-count":66,"title":["Solution Methodologies for the Smallest Enclosing Circle Problem"],"prefix":"10.1007","volume":"25","author":[{"given":"Sheng","family":"Xu","sequence":"first","affiliation":[]},{"given":"Robert M.","family":"Freund","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5118805_CR1","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"F. Barahona and P. Anbil, \u201cThe volume algorithm: Producing primal solutions with a subgradient method,\u201d Mathematical Programming, vol. 87, pp. 385-399, 2000.","journal-title":"Mathematical Programming"},{"key":"5118805_CR2","doi-asserted-by":"crossref","unstructured":"M. Berg, Computational Geometry: Algorithms and Applications, Springer, 1997.","DOI":"10.1007\/978-3-662-03427-9"},{"key":"5118805_CR3","unstructured":"D. Bertsimas and R. Freund, Data, Models, and Decisions: The Fundamentals of Management Science, South-Western College Pub., 2000."},{"key":"5118805_CR4","doi-asserted-by":"crossref","unstructured":"P. Chrystal, \u201cOn the problem to construct the minimum circle enclosing n given points in a plane,\u201d in Proceedings of the Edinburgh Mathematical Society, Third Meeting, 1885, p. 30.","DOI":"10.1017\/S0013091500037238"},{"key":"5118805_CR5","unstructured":"J. Eliosoff and R. Unger, \u201cMinimal spanning circle of a set of points,\u201d Computer Science 308-507: Computational Geometry Project, School of Computer Science, McGill University, 1998."},{"key":"5118805_CR6","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 Science, vol. 19, pp. 96-104, 1972.","journal-title":"Management Science"},{"key":"5118805_CR7","doi-asserted-by":"crossref","unstructured":"B. G\u00a8artner, \u201cFast and robust smallest enclosing balls,\u201d in Algorithms-ESA'99: 7th Annual European Symposium, Proceedings, J. Nestril (Ed.), vol. 1643 of Lecture Notes in Computer Science. Springer-Verlag, 1999, pp. 325-338.","DOI":"10.1007\/3-540-48481-7_29"},{"key":"5118805_CR8","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-795, 1982.","journal-title":"Oper. Res."},{"key":"5118805_CR9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"M. Lobo","year":"1998","unstructured":"M. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret, \u201cApplications of second-order cone programming,\u201d Linear Algebra and its Applications, vol. 284, pp. 193-228, 1998.","journal-title":"Linear Algebra and its Applications"},{"key":"5118805_CR10","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 R3 and related problems,\u201d SIAM J. Comput., vol. 12, pp. 759-776, 1983.","journal-title":"SIAM J. Comput."},{"key":"5118805_CR11","doi-asserted-by":"crossref","unstructured":"J. Sturm, \u201cUsing SeDuMi 1.0x, A MATLAB toolbox for optimization over symmetric cones,\u201d 1999. http:\/\/www.unimaas.nl\/sturm.","DOI":"10.1080\/10556789908805766"},{"key":"5118805_CR12","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.), vol. 555 of Lecture Notes in Computer Science. Springer-Verlag, 1991, pp. 359-370.","DOI":"10.1007\/BFb0038202"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022977709811.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022977709811\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022977709811.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:30:21Z","timestamp":1752377421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022977709811"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["5118805"],"URL":"https:\/\/doi.org\/10.1023\/a:1022977709811","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}