Continuous location of dimensional structures.
From MaRDI portal
Publication:1410321
DOI10.1016/S0377-2217(02)00647-1zbMath1040.90021MaRDI QIDQ1410321
Juan A. Mesa, Anita Schöbel, José-Miguel Díaz-Báñez
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Continuous location (90B85) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Discrete location and assignment (90B80)
Related Items (29)
The maximin HAZMAT routing problem ⋮ A hybrid fuzzy integral decision-making model for locating manufacturing centers in China: a case study ⋮ On finding widest empty curved corridors ⋮ Location-routing: issues, models and methods ⋮ Locating hyperplanes to fitting set of points: a general framework ⋮ The maximin line problem with regional demand ⋮ Extensive facility location problems on networks: an updated review ⋮ A global optimization procedure for the location of a median line in the three-dimensional space ⋮ Minmax-distance approximation and separation problems: geometrical properties ⋮ Locating an axis-parallel rectangle on a Manhattan plane ⋮ The \(k\)-centrum straight-line location problem ⋮ Efficient subspace approximation algorithms ⋮ The 1-Center and 1-Highway Problem ⋮ The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ The geometry of optimal partitions in location problems ⋮ The location of median paths on grid graphs ⋮ Location of weighted anti-ordered median straight lines with Euclidean distances ⋮ Simultaneous location of a service facility and a rapid transit line ⋮ The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers ⋮ Locating an obnoxious plane ⋮ Optimization problems for machine learning: a survey ⋮ Center location problems on tree graphs with subtree-shaped customers ⋮ THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS ⋮ Locating a general minisum `circle' on the plane ⋮ On location-allocation problems for dimensional facilities ⋮ Routing for unmanned aerial vehicles: touring dimensional sets ⋮ Optimal placement of base stations in border surveillance using limited capacity drones ⋮ Computing obnoxious 1-corner polygonal chains
Cites Work
- Finding the upper envelope of n line segments in O(n log n) time
- Diameter, width, closest line pair, and parametric searching
- Optimal slope selection via expanders
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- The power of geometric duality revisited
- Finding transversals for sets of simple geometric figures
- Geometric complexity of some location problems
- A linear-time algorithm for linear \(L_ 1\) approximation of points
- The minimax center estimation problem for automated roundness inspection
- Linear facility location. Solving extensions of the basic problem
- An upper bound on the number of planar \(K\)-sets
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
- Off-line dynamic maintenance of the width of a planar point set
- Convex functions, monotone operators and differentiability
- On some geometric selection and optimization problems via sorted matrices
- Fitting a set of points by a circle
- Median hyperplanes in normed spaces -- a survey
- Locating lines and hyperplanes. Theory and algorithms
- Location of rectilinear center trajectories
- Solving restricted line location problems via a dual interpretation
- Location and shape of a rectangular facility in \(\mathbb{R}^n\). Convexity properties
- Two characterizations of smooth norms
- Orthonormal distance fitting by circles and ellipses with given area
- Least-squares fitting of ellipses and hyperbolas
- Improved bounds for planar \(k\)-sets and related problems
- Optimal location of routes for vehicles transporting hazardous materials
- A near-linear algorithm for the planar segment-center problem
- Efficient randomized algorithms for some geometric optimization problems
- On the complexity of locating linear facilities in the plane
- Efficient piecewise-linear function approximation using the uniform metric
- An optimal algorithm for roundness determination on convex polygons
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
- A new algorithm for fitting a rectilinear x-monotone curve to a set of points in the plane
- Optimal Estimation of Executive Compensation by Linear Programming
- Approximation of Point Sets by 1-Corner Polygonal Chains
- Computing a largest empty anchored cylinder, and related problems
- Location of an Obnoxious Route
- Computing a Segment Center for a Planar Point Set
- Linear Curve Fitting Using Least Deviations
- Linear Programming Techniques for Regression Analysis
- Finding tailored partitions
- Linear Facility Location in Three Dimensions—Models and Solution Methods
- Finding Least-Distances Lines
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Linear Programming in Linear Time When the Dimension Is Fixed
- Computing the width of a set
- On minimax optimization problems
- 1-Segment Center Problems
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Fitting polygonal functions to a set of points in the plane
- Applications of Parametric Searching in Geometric Optimization
- GLOBAL OPTIMIZATION PROBLEM WITH MULTIPLE REVERSE CONVEX CONSTRAINTS AND ITS APPLICATION TO OUT-OF-ROUNDNESS PROBLEM
- Computing Envelopes in Four Dimensions with Applications
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
- The Largest Empty Annulus Problem
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- The two-line center problem from a polar view: a new algorithm and data structure
- A Note on Sharpe's Algorithm for Minimizing the Sum of Absolute Deviations in a Simple Regression Problem
- Approximation by circles
- Linear approximation of simple objects
- Dominators for multiple-objective quasiconvex maximization problems
- Fitting rectilinear polgonal curves to a set of points in the plane.
- Hyperplane transversals of homothetical, centrally symmetric polytopes
- Gauge distances and median hyperplanes
- Median and center hyperplanes in Minkowski spaces -- a unified approach
- On the circle closest to a set of points
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Continuous location of dimensional structures.
