TY - RPRT
A1 - Hamacher, H.W.
A1 - Labbé, M.
A1 - Nickel, S.
A1 - Sonneborn, T.
T1 - Polyhedral Properties of the Uncapacitated Multiple Allocation Hub Location Problem
N2 - 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 of this polyhedron. We develop some general rules about lifting facets from the uncapacitated facility location (UFL) for UHL and projecting facets from UHL to UFL. By applying these rules we get a new class of facets for UHL which dominates the inequalities in the original formulation. Thus we get a new formulation of UHL whose constraints are all facet–defining. We show its superior computational performance by benchmarking it on a well known data set.
T3 - Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) - 20
KW - integer programming
KW - hub location
KW - facility location
KW - valid inequalities
KW - facets
KW - branch and cut
Y1 - 2000
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1473
UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-12834
ER -