返回
Euclidean push-pull partial covering problems
DOI:10.1016/j.cor.2005.03.034.png)
摘要
En 中文
This paper considers a bicriteria model to locate a semi-obnoxious facility within a convex polygon. Assuming that a given number of closest points and farthest points may be neglected in the analysis, it considers simultaneously the resulting push and pull partial covering criteria with Euclidean distances. Although both objectives are neither concave or convex, low complexity polynomial algorithms to find all the efficient solutions and the tradeoffs involved are developed by way of higher-order Voronoi diagrams. Comparison of the tradeoff for full covering and partial covering enables decision makers to understand to what extent the maximin and minimax criteria are improved at the expense of neglecting some points. The extensions to different sets of points pulling and pushing the facility and to weighted points are discussed. All methods are illustrated via small scale examples. (c) 2005 Elsevier Ltd. All rights reserved.
Keyword:
semi-obnoxious facility
partial covering
efficient location
tradeoff curve
higher-order Voronoi diagram
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Cycloartanes from Oxyanthus pallidus and derivatives with analgesic activitiesOxyanthus pallidus来源的环阿屯烷及其具有镇痛活性的衍生物
Major dietary patterns and predicted cardiovascular disease risk in an Iranian adult population主要膳食模式与伊朗成人群体中预测的心血管疾病风险
Association of Healthy Diet with Recovery Time from COVID-19: Results from a Nationwide Cross-Sectional Study健康饮食与COVID-19恢复时间的关系:一项全国性横断面研究的结果
没有更多内容

