On solving the planar \(k\)-centrum problem with Euclidean distances
From MaRDI portal
Publication:613427
DOI10.1016/j.ejor.2010.06.004zbMath1206.90076OpenAlexW1970365126MaRDI QIDQ613427
Zvi Drezner, Inmaculada Espejo, Antonio M. Rodríguez-Chía
Publication date: 20 December 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.06.004
Numerical mathematical programming methods (65K05) Convex programming (90C25) Continuous location (90B85)
Related Items (3)
Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ One-dimensional center-based l 1-clustering method ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
Cites Work
- The ordered capacitated facility location problem
- The \(k\)-centrum straight-line location problem
- A note on the Weber location problem
- Finding an Euclidean anti-\(k\)-centrum location of a set of points
- k-Eccentricity and absolute k-centrum of a probabilistic tree
- On the exponential cardinality of FDS for the ordered \(p\)-median problem
- Heuristic procedures for solving the discrete ordered median problem
- Convex ordered median problem with \(\ell _p\)-norms
- On the point for which the sum of the distances to \(n\) given points is minimum
- On the convergence of the generalized Weiszfeld algorithm
- A flexible model and efficient solution strategies for discrete location problems
- Constructing a DC decomposition for ordered median problems
- Distribution systems design with role dependent objectives
- Accelerating convergence in the Fermat-Weber location problem
- Second-order cone programming
- On solving linear programs with the ordered weighted averaging objective.
- Minimizing the sum of the \(k\) largest functions in linear time.
- Algorithmic results for ordered median problems
- Conditional median: a parametric solution concept for location problems
- A polynomial time dual algorithm for the Euclidean multifacility location problem
- A flexible approach to location problems
- Solving the ordered one-median problem in the plane
- Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem
- A general model for the undesirable single facility location problem
- Euclidean push--pull partial covering problems
- Exact procedures for solving the discrete ordered median problem
- An efficient algorithm for the Euclidean \(r\)-centrum location problem
- Multicriteria planar ordered median problems
- Location Theory
- The Weber Problem On The Plane With Some Negative Weights
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- Properties of thek-centra in a tree network
- Centers to centroids in graphs
- Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
- Multifacility ordered median problems on networks: A further analysis
- QUADRATIC ORDERED MEDIAN LOCATION PROBLEMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- The \(k\)-centrum multi-facility location problem
- 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: On solving the planar \(k\)-centrum problem with Euclidean distances
