A branch and cut algorithm for hub location problems with single assignment
Date
2005
Authors
Labbé, M.
Yaman, H.
Gourdin, E.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Mathematical Programming
Print ISSN
0025-5610
Electronic ISSN
1436-4646
Publisher
Springer
Volume
102
Issue
2
Pages
371 - 405
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Citation Stats
Attention Stats
Usage Stats
1
views
views
25
downloads
downloads
Series
Abstract
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.