Polyhedral Analysis of Uncapacitated Single Allocation p-Hub Center Problems
- In contrast to p-hub problems with a summation objective (p-hub median), minmax hub problems (p-hub center) have not attained much attention in the literature. In this paper, we give a polyhedral analysis of the uncapacitated single allocation p-hub center problem (USApHCP). The analysis will be based on a radius formulation which currently yields the most efficient solution procedures. We show which of the valid inequalities in this formulation are facet-defining and present non-elementary classes of facets, for which we propose separation problems. A major part in our argumentation will be the close connection between polytopes of the USApHCP and the uncapacitated p-facility location (pUFL). Hence, the new classes of facets can also be used to improve pUFL formulations.
Verfasser*innenangaben: | Silke Jütte, Elena Gavriliouk, Horst Hamacher |
---|---|
URN: | urn:nbn:de:hbz:386-kluedo-14927 |
Schriftenreihe (Bandnummer): | Report in Wirtschaftsmathematik (WIMA Report) (109) |
Dokumentart: | Preprint |
Sprache der Veröffentlichung: | Englisch |
Jahr der Fertigstellung: | 2007 |
Jahr der Erstveröffentlichung: | 2007 |
Veröffentlichende Institution: | Technische Universität Kaiserslautern |
Datum der Publikation (Server): | 26.04.2007 |
Freies Schlagwort / Tag: | hub location; polyhedral analysis; uncapacitated facility location |
Fachbereiche / Organisatorische Einheiten: | Kaiserslautern - Fachbereich Mathematik |
DDC-Sachgruppen: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
Lizenz (Deutsch): | Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |