.png){kind=icon}
返回
INTEGER PROGRAMMING FORMULATIONS OF DISCRETE HUB LOCATION-PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(94)90318-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Hubs are facilities that serve as transshipment and switching points for transportation and telecommunication systems with many origins and destinations. This paper presents integer programming formulations for four types of discrete hub location problems: the p-hub median problem, the uncapacitated hub location problem, p-hub center problems and hub covering problems. Hub median and uncapacitated hub location problems have received limited attention from researchers. This paper introduces discrete hub center and hub covering problems. Basic formulations and formulations with flow thresholds for spokes are presented.
Keyword:
LOCATION
INTEGER PROGRAMMING
HUB LOCATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容