Locating lines and hyperplanes. Theory and algorithms
From MaRDI portal
Publication:1282587
zbMath0918.90102MaRDI QIDQ1282587
Publication date: 12 April 1999
Published in: Applied Optimization (Search for Journal in Brave)
continuous locationMinkowski spacelinear approximationcomputational geometryrobust statisticscenter hyperplanespath locationlinear fit problems
Related Items
Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ Equitable service by a facility: minimizing the Gini coefficient ⋮ Weighted Median of the Data in Solving Least Absolute Deviations Problems ⋮ The quintile share ratio in location analysis ⋮ Application of growth functions in the prediction of live weight of domestic animals ⋮ Minkowski Geometry—Some Concepts and Recent Developments ⋮ A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ Locating hyperplanes to fitting set of points: a general framework ⋮ Equity models in planar location ⋮ The extensive 1-median problem with radius on networks ⋮ A global optimization procedure for the location of a median line in the three-dimensional space ⋮ Generating valid linear inequalities for nonlinear programs via sums of squares ⋮ Continuous location of dimensional structures. ⋮ Searching for a best least absolute deviations solution of an overdetermined system of linear equations motivated by searching for a best least absolute deviations hyperplane on the basis of given data ⋮ The \(k\)-centrum straight-line location problem ⋮ Location of weighted anti-ordered median straight lines with Euclidean distances ⋮ Distributions of rectilinear deviation distance to visit a facility ⋮ Locating an obnoxious plane ⋮ Minsum hyperspheres in normed spaces ⋮ Gauge distances and median hyperplanes ⋮ On the multisource hyperplanes location problem to fitting set of points ⋮ Solving scheduling and location problems in the plane simultaneously ⋮ The big cube small cube solution method for multidimensional facility location problems ⋮ Three points method for searching the best least absolute deviations plane ⋮ Optimal number and length of point-like and line-like facilities of grid and random patterns ⋮ Locating a general minisum `circle' on the plane ⋮ THE BEST LEAST ABSOLUTE DEVIATIONS LINE – PROPERTIES AND TWO EFFICIENT METHODS FOR ITS DERIVATION ⋮ Locating a median line with partial coverage distance
