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.

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Author:Silke Jütte, Elena Gavriliouk, Horst Hamacher
URN (permanent link):urn:nbn:de:hbz:386-kluedo-14927
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (109)
Document Type:Preprint
Language of publication:English
Year of Completion:2007
Year of Publication:2007
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2007/04/26
Tag:hub location; polyhedral analysis; uncapacitated facility location
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581 $