Continuous location of dimensional structures.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 431989 (Why is no real title available?)
- scientific article; zbMATH DE number 3161646 (Why is no real title available?)
- scientific article; zbMATH DE number 4153914 (Why is no real title available?)
- scientific article; zbMATH DE number 4082817 (Why is no real title available?)
- scientific article; zbMATH DE number 1187120 (Why is no real title available?)
- scientific article; zbMATH DE number 19428 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 1340524 (Why is no real title available?)
- scientific article; zbMATH DE number 1340527 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 741008 (Why is no real title available?)
- scientific article; zbMATH DE number 1076401 (Why is no real title available?)
- scientific article; zbMATH DE number 1079755 (Why is no real title available?)
- scientific article; zbMATH DE number 1138444 (Why is no real title available?)
- scientific article; zbMATH DE number 1138445 (Why is no real title available?)
- scientific article; zbMATH DE number 1766719 (Why is no real title available?)
- 1-Segment Center Problems
- A Note on Sharpe's Algorithm for Minimizing the Sum of Absolute Deviations in a Simple Regression Problem
- A linear-time algorithm for linear \(L_ 1\) approximation of points
- A near-linear algorithm for the planar segment-center problem
- A new algorithm for fitting a rectilinear \(x\)-monotone curve to a set of points in the plane
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- An optimal algorithm for roundness determination on convex polygons
- An upper bound on the number of planar \(K\)-sets
- Applications of Parametric Searching in Geometric Optimization
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Approximation by circles
- Approximation of point sets by 1-corner polygonal chains
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
- Computing Envelopes in Four Dimensions with Applications
- Computing a Segment Center for a Planar Point Set
- Computing a largest empty anchored cylinder, and related problems
- Computing the width of a set
- Convex functions, monotone operators and differentiability
- Diameter, width, closest line pair, and parametric searching
- Dominators for multiple-objective quasiconvex maximization problems
- Efficient piecewise-linear function approximation using the uniform metric
- Efficient randomized algorithms for some geometric optimization problems
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
- Finding Least-Distances Lines
- Finding tailored partitions
- Finding the upper envelope of n line segments in O(n log n) time
- Finding transversals for sets of simple geometric figures
- Fitting a set of points by a circle
- Fitting polygonal functions to a set of points in the plane
- Fitting rectilinear polgonal curves to a set of points in the plane.
- GLOBAL OPTIMIZATION PROBLEM WITH MULTIPLE REVERSE CONVEX CONSTRAINTS AND ITS APPLICATION TO OUT-OF-ROUNDNESS PROBLEM
- Gauge distances and median hyperplanes
- Geometric complexity of some location problems
- Hyperplane transversals of homothetical, centrally symmetric polytopes
- Improved bounds for planar \(k\)-sets and related problems
- Least-squares fitting of ellipses and hyperbolas
- Linear Curve Fitting Using Least Deviations
- Linear Facility Location in Three Dimensions—Models and Solution Methods
- Linear Programming Techniques for Regression Analysis
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear approximation of simple objects
- Linear facility location. Solving extensions of the basic problem
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Locating lines and hyperplanes. Theory and algorithms
- Location and shape of a rectangular facility in \(\mathbb{R}^n\). Convexity properties
- Location of an Obnoxious Route
- Location of rectilinear center trajectories
- Median and center hyperplanes in Minkowski spaces -- a unified approach
- Median hyperplanes in normed spaces -- a survey
- Off-line dynamic maintenance of the width of a planar point set
- On minimax optimization problems
- On some geometric selection and optimization problems via sorted matrices
- On the circle closest to a set of points
- On the complexity of locating linear facilities in the plane
- Optimal estimation of executive compensation by linear programming
- Optimal location of routes for vehicles transporting hazardous materials
- Optimal slope selection via expanders
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
- Orthonormal distance fitting by circles and ellipses with given area
- Solving restricted line location problems via a dual interpretation
- The Largest Empty Annulus Problem
- The half-line centre problem with \(l_1(l_{\infty})\) metrics.
- The minimax center estimation problem for automated roundness inspection
- The power of geometric duality revisited
- The two-line center problem from a polar view: a new algorithm and data structure
- Two characterizations of smooth norms
Cited in
(32)- The maximin line problem with regional demand
- The location of median paths on grid graphs
- The 1-center and 1-highway problem
- Locating hyperplanes to fitting set of points: a general framework
- Visualizing data as objects by DC (difference of convex) optimization
- Computing obnoxious 1-corner polygonal chains
- Locating a general minisum `circle' on the plane
- Location-routing: issues, models and methods
- scientific article; zbMATH DE number 776093 (Why is no real title available?)
- THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS
- The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
- Center location problems on tree graphs with subtree-shaped customers
- A global optimization procedure for the location of a median line in the three-dimensional space
- Routing for unmanned aerial vehicles: touring dimensional sets
- Optimal placement of base stations in border surveillance using limited capacity drones
- Extensive facility location problems on networks: an updated review
- Continuous location of an assembly station
- The geometry of optimal partitions in location problems
- On location-allocation problems for dimensional facilities
- Efficient subspace approximation algorithms
- Location of weighted anti-ordered median straight lines with Euclidean distances
- Locating an obnoxious plane
- The \(k\)-centrum straight-line location problem
- Optimization problems for machine learning: a survey
- A hybrid fuzzy integral decision-making model for locating manufacturing centers in China: a case study
- Locating an axis-parallel rectangle on a Manhattan plane
- Continuous location under the effect of `refraction'
- Simultaneous location of a service facility and a rapid transit line
- The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited
- The maximin HAZMAT routing problem
- On finding widest empty curved corridors
- Minmax-distance approximation and separation problems: geometrical properties
This page was built for publication: Continuous location of dimensional structures.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1410321)
