Pages that link to "Item:Q1810982"

The following pages link to Solution methodologies for the smallest enclosing circle problem (Q1810982):

Displaying 27 items.

• Approximations of differentiable convex functions on arbitrary convex polytopes (Q279182) (← links)
• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
• On enclosing k points by a circle (Q674185) (← links)
• An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
• On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls (Q946350) (← links)
• Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming (Q1035905) (← links)
• Efficient algorithms for the smallest enclosing ball problem (Q1774576) (← links)
• Chebyshev center and inscribed balls: properties and calculations (Q2080823) (← links)
• Covering a set by a convex compactum: error estimates and computation (Q2090531) (← links)
• An efficient cutting plane algorithm for the smallest enclosing circle problem (Q2358480) (← links)
• On the geometry of the smallest circle enclosing a finite set of points (Q2382759) (← links)
• An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552) (← links)
• A new approximate algorithm for the Chebyshev center (Q2628686) (← links)
• The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory (Q2629705) (← links)
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
• A reformulation-linearization based algorithm for the smallest enclosing circle problem (Q2666744) (← links)
• An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization (Q2678998) (← links)
• On a sequential linear programming approach to finding the smallest circumscribed, largest inscribed, and minimum zone circle or sphere (Q2746393) (← links)
• (Q3391378) (← links)
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS (Q4824662) (← links)
• Efficient Speed-Up of the Smallest Enclosing Circle Algorithm (Q5040739) (← links)
• Chebyshev centres, Jung constants, and their applications (Q5220255) (← links)
• Approximate minimum enclosing balls in high dimensions using core-sets (Q5463443) (← links)
• The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\) (Q6103201) (← links)
• A fast solver for the narrow capture and narrow escape problems in the sphere (Q6145389) (← links)