Adapting polyhedral properties from facility to hub location problems

被引:98
|
作者
Hamacher, HW [1 ]
Labbé, M
Nickel, S
Sonneborn, T
机构
[1] Univ Kaiserslautern, Fachbereich Math, D-67663 Kaiserslautern, Germany
[2] Free Univ Brussels, Serv Math Gest, B-1050 Brussels, Belgium
[3] Univ Saarland, D-6600 Saarbrucken, Germany
[4] Fraunhofer Inst Techno & Wirtschaftmath, ITWM, Kaiserslautern, Germany
[5] PTV Traff Mobil Logist, Karlsruhe, Germany
关键词
integer programming; hub location; facility location; valid inequality; facet;
D O I
10.1016/j.dam.2003.09.011
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple allocation, which has applications in the fields of air passenger and cargo transportation, telecommunication and postal delivery services. In particular we determine the dimension and derive some classes of facets for this polyhedron. We develop a general rule about lifting facets from the uncapacitated facility location problem to UHL. Using this lifting procedure we derive a new class of facets for UHL which dominates the inequalities in the original formulation. Thus we obtain a new formulation of the UHL whose constraints are all facet-defining. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:104 / 116
页数:13
相关论文
共 50 条