.png){kind=icon}
返回
ON THE CONDITIONAL P-MEDIAN PROBLEM
.png){kind=icon}
PRE
AI
DOI：10.1016/0305-0548(94)00033-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we investigate the conditional p-median problem. Optimal algorithms for the Euclidean case in the plane for the 1-median with several existing facilities are proposed. A general heuristic algorithm for any metric or environment (network or continuous space) is presented. The algorithm is based on solving several p-median problems.
Keyword:
FACILITIES LOCATION ALGORITHMS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容