Finding Least-Distances Lines
From MaRDI portal
Cites work
- A Note on Sharpe's Algorithm for Minimizing the Sum of Absolute Deviations in a Simple Regression Problem
- An Iterative Technique for Absolute Deviations Curve Fitting
- Combinatorial Optimization with Rational Objective Functions
- scientific article; zbMATH DE number 3161646 (Why is no real title available?)
- Linear Curve Fitting Using Least Deviations
- Linear Programming Techniques for Regression Analysis
- Mean-Absolute-Deviation Characteristic Lines for Securities and Portfolios
- New Parallel-Sorting Schemes
- Optimal estimation of executive compensation by linear programming
- Time bounds for selection
Cited in
(17)- The power of geometric duality revisited
- An iterative linear programming solution to the Euclidean regression model
- Extending NC and RNC algorithms
- Median hyperplanes in normed spaces -- a survey
- Solving restricted line location problems via a dual interpretation
- Continuous location of dimensional structures.
- Locating hyperplanes to fitting set of points: a general framework
- On the complexity of locating linear facilities in the plane
- Locating a median line with partial coverage distance
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
- Line Facility Location in Weighted Regions
- Line Segment Facility Location in Weighted Subdivisions
- Approximating finite weighted point sets by hyperplanes
- The two-line center problem from a polar view: a new algorithm and data structure
- Line facility location in weighted regions
- POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
- Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem
This page was built for publication: Finding Least-Distances Lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3665109)
