scientific article; zbMATH DE number 2065332
From MaRDI portal
Publication:4459964
For a finite set \(A\) in a real inner product space \(X\) and for \(x \in X\), let \(Z(A)\) denote the singleton, \[ Z(A) =\{x^\ast : \max \{\| a-x^\ast\| :a \in A\} \leq \max \{\| a-x\| :a \in A\}\}. \] For a convex set \(K\), let \(Z_K(A)=\{x^\ast: x^\ast \in Z(A)~\forall~ x \in K\}\). When \(K\) is a polyhedral convex set in \(\mathbb R^n\) of dimension \(\alpha \leq n\), the authors give a polyhedrally constrained algorithm that converges to \(Z_K(A)\). For the entire collection see [Zbl 1028.00020].
Recommendations
- scientific article; zbMATH DE number 1967834
- Facility location constrained to a polygonal domain
- CONSTRAINED OPTIMAL LOCATION
- Efficiency in Euclidean constrained location problems
- scientific article; zbMATH DE number 4204110
- Polyhedral analysis for concentrator location problems
- Facility location on a polyhedral surface
- Existence and characterization of optimal locations
- scientific article; zbMATH DE number 764411
- Finding satisfactory near-optimal solutions in location problems
Cited in
(7)- Anchored hyperplane location problems
- Solving convex location problems with gauges in polynomial time
- CONSTRAINED OPTIMAL LOCATION
- Facility location constrained to a polygonal domain
- scientific article; zbMATH DE number 1967834 (Why is no real title available?)
- scientific article; zbMATH DE number 1822170 (Why is no real title available?)
- Base Location Problems for Base-Monotone Regions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459964)