.png){kind=icon}
Return
An efficient algorithm for the Euclidean r-centrum location problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2004.06.122.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we consider the single-facility Euclidean r-centrum location problem in R-n, which generalizes and unifies the classical 1-center and 1-median problem. Specifically, we reformulate this problem as a nonsmooth optimization problem only involving the maximum function, and then develop a smoothing algorithm that is shown to be globally convergent. The method transforms the original nonsmooth problem with certain combinatorial property into the solution of a deterministic smooth unconstrained optimization problem. Numerical results are presented for some problems generated randomly, indicating that the algorithm proposed here is extremely efficient for large problems. (c) 2004 Elsevier Inc. All rights reserved.
Keywords:
Euclidean r-centrum location problem
sum of the r-largest functions
nonsmooth
smoothing method
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more