.png){kind=icon}
返回
Single-facility huff location problems on networks
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-013-1445-x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Huff location problems have been extensively analyzed within the field of competitive continuous location. In this work, two Huff location models on networks are addressed, by considering that users go directly to the facility or they visit the facility in their way to a destination. Since the problems are multimodal, a branch and bound algorithm is proposed, in which two different bounding strategies, based on Interval Analysis and DC optimization, are used and compared. Computational results are given for the two bounding procedures, showing that problems of rather realistic size can be solved in reasonable time.
Keyword:
Huff location models
Location on networks
DC optimization
Interval analysis
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
分享收藏分享收藏Injury-Dependent and Disability-Specific Lumbar Spinal Gene Regulation following Sciatic Nerve Injury in the Rat大鼠坐骨神经损伤后损伤依赖性和残疾特异性腰椎基因调控.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容