科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we consider the problem of computing the smallest enclosing circle. An efficient cutting plane algorithm is derived. It is based on finding the valid cut and reducing the problem into solving a series of linear programs. The numerical performance of this algorithm outperforms other existing algorithms in our computational experiments.
- 出版日期2017-1
- 单位四川师范大学
