.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Euclidean r-centrum location problem
sum of the r-largest functions
nonsmooth
smoothing method
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容