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 thesis, 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.
Author: | Tanja Meyer |
---|---|
URN: | urn:nbn:de:hbz:386-kluedo-14035 |
Document Type: | Diploma Thesis |
Language of publication: | English |
Year of Completion: | 2005 |
Year of first Publication: | 2005 |
Publishing Institution: | Technische Universität Kaiserslautern |
Granting Institution: | Technische Universität Kaiserslautern |
Date of the Publication (Server): | 2006/01/05 |
Tag: | facets; hub covering; hub location; integer programming |
Page Number: | 86 |
Faculties / Organisational entities: | Kaiserslautern - Fachbereich Mathematik |
DDC-Cassification: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
Licence (German): | Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |