.png){kind=icon}
返回
Improved algorithms for placing undesirable facilities
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(01)00063-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We improve several existing algorithms for determining the location of one or more undesirable facilities amidst a set P of n demand points, under various constraints and distance functions. We assume that the demand points reside within some given bounded region R. Applying concepts and techniques from Computational Geometry, we provide efficient algorithms for the following problems: (1) Maxmin multi-facility location: Locate k undesirable facilities within R under the constraints that the smallest distance between each demand point and the facilities is at least a given r, and the distance between any two facilities is at least a given D. Under the L-infinity (L-1) norm we present efficient algorithms for any k, and under the L-2 norm we can locate efficiently two such facilities. In all cases, R is assumed to be an axis-parallel rectangle. (2) Minsum coverage: Given a set of weighted demand points contained in an axis-parallel rectangular region R, and given a smaller axis-parallel rectangle Q, place Q within R such that the sum of weights of the demand points contained in Q is minimized.
Keyword:
facility location
computational geometry
maxmin
minsum
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
分享收藏Allylation of a lignin model phenol: a highly selective reaction under benign conditions towards a new thermoset resin platform.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAI分享收藏分享收藏
查看更多内容