INTEGER PROGRAMMING FORMULATIONS OF DISCRETE HUB LOCATION-PROBLEMS

被引:602
作者
CAMPBELL, JF
机构
[1] Department of Management Science, Information Systems. School of Business Administration, University of Missouri-St. Louis, St. Louis, MO 63121
关键词
LOCATION; INTEGER PROGRAMMING; HUB LOCATION;
D O I
10.1016/0377-2217(94)90318-2
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:387 / 405
页数:19
相关论文
共 41 条