.png){kind=icon}
返回
THE MAXIMUM-CAPTURE HIERARCHICAL LOCATION PROBLEM
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(92)90125-S.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present a 0-1 integer programming model for locating services with a hierarchical structure when there is competition in the region of interest. The model utilizes a hierarchical covering formulation and it allows the location of new servers as well as the relocation of existing servers. Computational experience is provided.
Keyword:
COMPETITIVE FACILITIES
LOCATION
INTEGER PROGRAMMING
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Effect of Radiant Warmer on Transepidermal Water Loss (TEWL) and Skin Hydration in Preterm Infants
OAAI
OAAI分享收藏 没有更多内容
没有更多内容