Continuous location of dimensional structures.
type: Item
instance of: scholarly article
title: Continuous location of dimensional structures.
zbMATH Open document ID: 1040.90021
DOI: 10.1016/S0377-2217(02)00647-1
author: Juan A. Mesa
author: Anita Schöbel
author: J. M. Díaz-Báñez
published in: European Journal of Operational Research
publication date: 2003-10-14T00:00:00Z
review text: In classical location problems, we have to find one or several points for placing new facilities such that they optimize one or several possibly constrained objective functions. Usually the functions depend on the interactions among demand points and new facilities. When the new facilities cannot be represented as points but some kind of dimensional sets (such as straight lines, line-segments, polygonal curves, or circles), then extensive facility location problems arise. In this paper a survey of the existing work on the location of extensive facilities in continuous spaces is given. Gaps in the knowledge are identified and suggestions for further research are made. The list of references consists of 161 items.
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 52C35
zbMATH DE Number: 1992610
zbMATH Keywords: location
zbMATH Keywords: extensive facilities
zbMATH Keywords: dimensional structures
zbMATH Keywords: computational geometry
MaRDI profile type: Publication
cites work: Computing Envelopes in Four Dimensions with Applications
cites work: Computing a Segment Center for a Planar Point Set
cites work: Off-line dynamic maintenance of the width of a planar point set
cites work: Q4325546
cites work: Efficient randomized algorithms for some geometric optimization problems
cites work: Applications of Parametric Searching in Geometric Optimization
cites work: Q3978914
cites work: Optimal location of routes for vehicles transporting hazardous materials
cites work: Linear Facility Location in Three Dimensions—Models and Solution Methods
cites work: Q4265885
cites work: Location and shape of a rectangular facility in \(\mathbb{R}^n\). Convexity properties
cites work: Dominators for multiple-objective quasiconvex maximization problems
cites work: APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
cites work: Optimal estimation of executive compensation by linear programming
cites work: Diameter, width, closest line pair, and parametric searching
cites work: GLOBAL OPTIMIZATION PROBLEM WITH MULTIPLE REVERSE CONVEX CONSTRAINTS AND ITS APPLICATION TO OUT-OF-ROUNDNESS PROBLEM
cites work: Improved bounds for planar \(k\)-sets and related problems
cites work: The half-line centre problem with \(l_1(l_{\infty})\) metrics.
cites work: Approximation of point sets by 1-corner polygonal chains
cites work: The Largest Empty Annulus Problem
cites work: Location of rectilinear center trajectories
cites work: Fitting rectilinear polgonal curves to a set of points in the plane.
cites work: On minimax optimization problems
cites work: On the circle closest to a set of points
cites work: Location of an Obnoxious Route
cites work: Finding transversals for sets of simple geometric figures
cites work: A near-linear algorithm for the planar segment-center problem
cites work: Q3279706
cites work: Computing a largest empty anchored cylinder, and related problems
cites work: Fitting a set of points by a circle
cites work: Q3840324
cites work: On some geometric selection and optimization problems via sorted matrices
cites work: COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
cites work: Efficient piecewise-linear function approximation using the uniform metric
cites work: APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
cites work: Fitting polygonal functions to a set of points in the plane
cites work: Finding the upper envelope of n line segments in O(n log n) time
cites work: Finding tailored partitions
cites work: Q4265882
cites work: Computing the width of a set
cites work: Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
cites work: Q4538131
cites work: A linear-time algorithm for linear \(L_ 1\) approximation of points
cites work: 1-Segment Center Problems
cites work: The two-line center problem from a polar view: a new algorithm and data structure
cites work: Linear Curve Fitting Using Least Deviations
cites work: Optimal slope selection via expanders
cites work: Q4327373
cites work: Q3482828
cites work: Q3138748
cites work: Q4383638
cites work: The power of geometric duality revisited
cites work: Geometric complexity of some location problems
cites work: Q4203976
cites work: Q4383639
cites work: Two characterizations of smooth norms
cites work: Median hyperplanes in normed spaces -- a survey
cites work: Median and center hyperplanes in Minkowski spaces -- a unified approach
cites work: Hyperplane transversals of homothetical, centrally symmetric polytopes

Continuous location of dimensional structures. (cites work)
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Continuous location of dimensional structures. (cites work)
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems

Continuous location of dimensional structures. (cites work)
cites work: Linear Programming in Linear Time When the Dimension Is Fixed

Continuous location of dimensional structures. (cites work)
cites work: On the complexity of locating linear facilities in the plane

Continuous location of dimensional structures. (cites work)
cites work: Finding Least-Distances Lines

Continuous location of dimensional structures. (cites work)
cites work: Q3813185

Continuous location of dimensional structures. (cites work)
cites work: Linear facility location. Solving extensions of the basic problem

Continuous location of dimensional structures. (cites work)
cites work: Q4361347

Continuous location of dimensional structures. (cites work)
cites work: An upper bound on the number of planar \(K\)-sets

Continuous location of dimensional structures. (cites work)
cites work: Convex functions, monotone operators and differentiability

Continuous location of dimensional structures. (cites work)
cites work: Gauge distances and median hyperplanes

Continuous location of dimensional structures. (cites work)
cites work: A Note on Sharpe's Algorithm for Minimizing the Sum of Absolute Deviations in a Simple Regression Problem

Continuous location of dimensional structures. (cites work)
cites work: Approximation by circles

Continuous location of dimensional structures. (cites work)
cites work: Linear approximation of simple objects

Continuous location of dimensional structures. (cites work)
cites work: Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error

Continuous location of dimensional structures. (cites work)
cites work: Q4359761

Continuous location of dimensional structures. (cites work)
cites work: Solving restricted line location problems via a dual interpretation

Continuous location of dimensional structures. (cites work)
cites work: Locating lines and hyperplanes. Theory and algorithms

Continuous location of dimensional structures. (cites work)
cites work: Least-squares fitting of ellipses and hyperbolas

Continuous location of dimensional structures. (cites work)
cites work: Orthonormal distance fitting by circles and ellipses with given area

Continuous location of dimensional structures. (cites work)
cites work: An optimal algorithm for roundness determination on convex polygons

Continuous location of dimensional structures. (cites work)
cites work: The minimax center estimation problem for automated roundness inspection

Continuous location of dimensional structures. (cites work)
cites work: Linear Programming Techniques for Regression Analysis

Continuous location of dimensional structures. (cites work)
cites work: A new algorithm for fitting a rectilinear \(x\)-monotone curve to a set of points in the plane

Continuous location of dimensional structures. (cites work)
cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems