An efficient algorithm for the Euclidean \(r\)-centrum location problem

DOI10.1016/j.amc.2004.06.122zbMath1105.65332OpenAlexW2042501232MaRDI QIDQ2570749

Shaohua Pan, Xing-Si Li

Publication date: 28 October 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.06.122

zbMATH Keywords

nonsmooth optimizationnumerical resultssmoothing algorithm1-median problemsingle-facility Euclidean \(r\)-centrum location problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ Center-configuration selection technique for the reconfigurable modular robot

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• k-Eccentricity and absolute k-centrum of a probabilistic tree
• On the entropic regularization method for solving min-max problems with applications
• 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
• Smoothing methods for convex inequalities and linear complementarity problems
• A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms
• Properties of thek-centra in a tree network
• Centers to centroids in graphs
• Determinant Maximization with Linear Matrix Inequality Constraints
• An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
• Minimax parametric optimization problems and multi-dimensional parametric searching
• The \(k\)-centrum multi-facility location problem

This page was built for publication: An efficient algorithm for the Euclidean \(r\)-centrum location problem