.png){kind=icon}
返回
Covering problems with polyellipsoids: A location analysis perspective
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2020.06.048.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we analyze the extension of the classical smallest enclosing disk problem to the case of the location of a polyellipsoid to fully cover a set of demand points in R-d. We prove that the problem is polynomially solvable in fixed dimension and analyze mathematical programming formulations for it. We also consider some geometric approaches for the problem in case the foci of the polyellipsoids are known. Extensions of the classical algorithm by Elzinga-Hearn are also derived for this new problem. Moreover, we address two extensions of the problem, as the case where the foci of the enclosing polyellipsoid are not given and have to be determined among a potential set of points or the induced covering problems when instead of polyellipsoids, one uses ordered median polyellipsoids. For these problems we also present Mixed Integer (Non) Linear Programming strategies that lead to efficient ways to solve it. Extensive computational experiments on different datasets show the usefulness of our solution methods. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Polyellipsoids
Covering location
Minimum enclosing disk
Second order cone programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏Deterministic and stochastic global optimization techniques for planar covering with ellipses problems带有椭圆问题的平面覆盖的确定性和随机全局优化技术
PREAI
分享收藏Minimizing ordered weighted averaging of rational functions with applications to continuous location
PREAI
分享收藏
查看更多内容