Efficient Algorithms for the (Weighted) Minimum Circle Problem

Cited in

(33)

Solving \(k\)-center problems involving sets based on optimization techniques
Continuous center problems
The minimax center estimation problem for automated roundness inspection
Chebyshev subspaces of JBW\(^{\ast}\)-triples
The 1-center problem in the plane with independent random weights
The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
An efficient algorithm for the smallest enclosing ball problem in high dimensions
The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
Circle fitting by linear and nonlinear least squares
Identification of active component functions in finite-max minimisation via a smooth reformulation
Locational optimization problems solved through Voronoi diagrams
A new algorithm for the minimax location problem with the closest distance
An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
A planar minimax algorithm for analysis of coordinate measurements
A polynomial time algorithm for a hemispherical minimax location problem
A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms
Covering problems with polyellipsoids: a location analysis perspective
Spherical minimax location problem using the Euclidean norm: Formulation and optimization
Efficient algorithms for the smallest enclosing ball problem
Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
The weighted Euclidean one-center problem in \(\mathbb{R}^n\)
Solution of an equiweighted minimax location problem on a hemisphere
A reformulation-linearization based algorithm for the smallest enclosing circle problem
Locational analysis
Locating a central hunter on the plane
The compromise hypersphere for multiobjective linear programming
Application of decision analysis techniques to the Weber facility location problem
A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
On the complexity of the exchange algorithm for minimax optimization problems
Finding an Euclidean anti-\(k\)-centrum location of a set of points
An efficient cutting plane algorithm for the smallest enclosing circle problem

This page was built for publication: Efficient Algorithms for the (Weighted) Minimum Circle Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3947425)