Locating a general minisum `circle' on the plane
From MaRDI portal
Publication:766255
DOI10.1007/s10288-011-0169-5zbMath1233.90215OpenAlexW1978730351MaRDI QIDQ766255
Anita Schöbel, Henrik Juel, Mark-Christoph Körner, Jack Brimberg
Publication date: 23 March 2012
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-011-0169-5
Applications of mathematical programming (90C90) Continuous location (90B85) Nonconvex programming, global optimization (90C26)
Related Items (4)
Locating a minisum annulus: a new partial coverage distance model ⋮ Locating an axis-parallel rectangle on a Manhattan plane ⋮ The geometry of optimal partitions in location problems ⋮ Minsum hyperspheres in normed spaces
Cites Work
- Geometric fit of a point set by generalized circles
- Fitting circles to data with correlated noise
- Locating a minisum circle in the plane
- Geometrical properties of the Fermat-Weber problem
- Locating lines and hyperplanes. Theory and algorithms
- Continuous location of dimensional structures.
- A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
- The Fermat--Torricelli problem in normed planes and spaces
- Locating median cycles in networks
- Median spheres: Theory, algorithms, applications
- Location Theory
- Locating a Circle on a Sphere
- Using Block Norms for Location Modeling
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- Some Characterizations of Inner-Product Spaces
- On bisectors for different distance functions
- On the circle closest to a set of points
- Unnamed Item
This page was built for publication: Locating a general minisum `circle' on the plane
