Please use this identifier to cite or link to this item: https://doi.org/10.1023/A:1022977709811
Title: Solution methodologies for the smallest enclosing circle problem
Authors: Xu, S.
Freund, R.M.
Sun, J. 
Keywords: Computational geometry
Optimization
Issue Date: Apr-2003
Citation: Xu, S., Freund, R.M., Sun, J. (2003-04). Solution methodologies for the smallest enclosing circle problem. Computational Optimization and Applications 25 (1-3) : 283-292. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1022977709811
Abstract: Given a set of circles C = {c1,..., cn} on the Euclidean plane with centers {(a1, b1),..., (an, bn)} and radii {r1,.... rn}, the smallest enclosing circle (of fixed circles) problem is to find the circle of minimum radius that encloses all circles in C. We survey four known approaches for this problem, including a second order cone reformulation, a subgradient approach, a quadratic programming scheme, and a randomized incremental algorithm. For the last algorithm we also give some implementation details. It turns out the quadratic programming scheme outperforms the other three in our computational experiment.
Source Title: Computational Optimization and Applications
URI: http://scholarbank.nus.edu.sg/handle/10635/114876
ISSN: 09266003
DOI: 10.1023/A:1022977709811
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

36
checked on Jul 17, 2018

WEB OF SCIENCETM
Citations

32
checked on Jun 20, 2018

Page view(s)

47
checked on May 11, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.