Efficient Algorithms for the (Weighted) Minimum Circle Problem
From MaRDI portal
Publication:3947425
DOI10.1287/opre.30.4.777zbMath0486.90039OpenAlexW2139115571WikidataQ63549485 ScholiaQ63549485MaRDI QIDQ3947425
Publication date: 1982
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.30.4.777
classification schemecomputational testssingle facility locationefficient new algorithmsweighted minimum covering circle problem
Related Items (31)
An efficient cutting plane algorithm for the smallest enclosing circle problem ⋮ 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 ⋮ A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) ⋮ The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory ⋮ An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions ⋮ A planar minimax algorithm for analysis of coordinate measurements ⋮ Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments ⋮ An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms ⋮ The minimax center estimation problem for automated roundness inspection ⋮ Solution of an equiweighted minimax location problem on a hemisphere ⋮ A reformulation-linearization based algorithm for the smallest enclosing circle problem ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ On the complexity of the exchange algorithm for minimax optimization problems ⋮ A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) ⋮ Locational analysis ⋮ The 1-center problem in the plane with independent random weights ⋮ Locating a central hunter on the plane ⋮ Efficient algorithms for the smallest enclosing ball problem ⋮ Covering problems with polyellipsoids: a location analysis perspective ⋮ Finding an Euclidean anti-\(k\)-centrum location of a set of points ⋮ Spherical minimax location problem using the Euclidean norm: Formulation and optimization ⋮ Solving \(k\)-center problems involving sets based on optimization techniques ⋮ Locational optimization problems solved through Voronoi diagrams ⋮ Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints ⋮ Continuous Center Problems ⋮ A polynomial time algorithm for a hemispherical minimax location problem ⋮ Circle fitting by linear and nonlinear least squares ⋮ The compromise hypersphere for multiobjective linear programming ⋮ Application of decision analysis techniques to the Weber facility location problem ⋮ Chebyshev subspaces of JBW\(^{\ast}\)-triples
This page was built for publication: Efficient Algorithms for the (Weighted) Minimum Circle Problem
