Hub Cover and Hub Center Problems

Technical Report, Reports in Wirtschaftsmathematik, Number 98, Technische Universität Kaiserslautern, Available at http://kluedo.ub.uni-kl.de/volltexte/2006/1966/, 2006

Authors

• Horst W. Hamacher
• Tanja Meyer

Abstract

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.

BibTeX

 
@TechReport{ HamacherMeyer:HubLoc, 
   title = { Hub Cover and Hub Center Problems }, 
   author = { Horst W. Hamacher and Tanja Meyer },     
   series = { Reports in Wirtschaftsmathematik },  
   number = { 98 }, 
   institution = { Technische Universität Kaiserslautern },       
   note = { Available at http://kluedo.ub.uni-kl.de/volltexte/2006/1966/ },  
   year = 2006, 
} 

---

This publication belongs to the project DeNDeMA.