.png){kind=icon}
返回
THE ZONE-CONSTRAINED LOCATION PROBLEM ON A NETWORK
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(91)90089-E.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we consider the m-median and m-center problems on a network, subject to zone-type constraints. These constraints require that at least one server be located in each one of several perspecified zones that may overlap. The zones may be municipal districts, geographical zones, equity-type zones and so on. Special cases of the problem include the m-medi-center problem and the m-center (or m-median) problem with user-dependent distance constraints. The paper includes a relaxation algorithm where in each step of the algorithm a relaxed problem is solved. For the m-center problem with user-dependent distance constraints the relaxation algorithm can be refined by taking advantage of an available method to solve the relaxed problem. Computational experience suggests that the algorithm performs well for large problems.
Keyword:
LOCATION
ZONE CONSTRAINTS
NETWORKS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容