.png){kind=icon}
返回
A framework for demand point and solution space aggregation analysis for location models
.png){kind=icon}
PRE
AI
DOI：10.1016/s0377-2217(03)00433-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many location problems can be formulated as minimizing some location objective function subject to upper bounds on other location constraint functions. When such functions are subadditive and nondecreasing in the distances (a common occurrence), worst-case demand point aggregation error bounds are known. We show how to solve a relaxation and a restriction of the aggregated problem in such a way as to obtain lower and upper bounds on the optimal value of the original problem. We consider some applications to covering and related problems. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
location
aggregation error
covering
demand points
K-centers
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容