Locating a median line with partial coverage distance
From MaRDI portal
Publication:2349526
DOI10.1007/s10898-014-0239-2zbMath1318.90047OpenAlexW2097555437MaRDI QIDQ2349526
Robert Schieweck, Anita Schöbel, Jack Brimberg
Publication date: 22 June 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0239-2
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A global optimization procedure for the location of a median line in the three-dimensional space
- Linear separation and approximation by minimizing the sum of concave functions of distances
- A destination optimality in asymmetric distance Fermat-Weber problems
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
- The power of geometric duality revisited
- Generalized concavity
- Median hyperplanes in normed spaces -- a survey
- Locating lines and hyperplanes. Theory and algorithms
- Arbitrary-norm separating plane
- Two characterizations of smooth norms
- Properties of three-dimensional median line location models
- Locating a Circle on a Sphere
- Linear Facility Location in Three Dimensions—Models and Solution Methods
- Finding Least-Distances Lines
- Computing the width of a set
- Constructing Belts in Two-Dimensional Arrangements with Applications
- Linear approximation of simple objects
- Gauge distances and median hyperplanes
- Median and center hyperplanes in Minkowski spaces -- a unified approach
This page was built for publication: Locating a median line with partial coverage distance
