Hub Cover and Hub Center Problems

  • Using covering problems (CoP) combined with binary search is a well-known and successful solution approach for solving continuous center problems. In this paper, we show that this is also true for center hub location problems in networks. We introduce and compare various formulations for hub covering problems (HCoP) and analyse the feasibility polyhedron of the most promising one. Computational results using benchmark instances are presented. These results show that the new solution approach performs better in most examples.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Horst W. Hamacher, Tanja Meyer
URN (permanent link):urn:nbn:de:hbz:386-kluedo-14350
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (98)
Document Type:Preprint
Language of publication:English
Year of Completion:2006
Year of Publication:2006
Publishing Institute:Technische Universität Kaiserslautern
Tag:facets; hub covering ; hub location ; integer programming ; valid inequalities
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik

$Rev: 12793 $