A branch and cut algorithm for hub location problems with single assignment

• 成果类型: Article
• 署名作者: Labbé, M; Yaman, H; Gourdin, E
• 署名单位: Universite Libre de Bruxelles; Ihsan Dogramaci Bilkent University; Orange SA
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-004-0531-x
• 发表日期: 2005
• 页码: 371-405
• 关键词: capacitated facility location; valid inequalities; facets

摘要

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results.