A reformulation-linearization based algorithm for the smallest enclosing circle problem
From MaRDI portal
Publication:2666744
Recommendations
- An efficient cutting plane algorithm for the smallest enclosing circle problem
- Solution methodologies for the smallest enclosing circle problem
- Computing the smallest k-enclosing circle and related problems
- A simple algorithm for computing the smallest enclosing circle
- Efficient algorithms for the smallest enclosing ball problem
Cites work
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A simple algorithm for computing the smallest enclosing circle
- An efficient algorithm for the smallest enclosing ball problem in high dimensions
- An efficient cutting plane algorithm for the smallest enclosing circle problem
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Computational geometry. Algorithms and applications.
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Efficient algorithms for the smallest enclosing ball problem
- Solution methodologies for the smallest enclosing circle problem
- Two Algorithms for the Minimum Enclosing Ball Problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(2)
This page was built for publication: A reformulation-linearization based algorithm for the smallest enclosing circle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2666744)
