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.
| Original language | English |
|---|---|
| Pages (from-to) | 371-405 |
| Number of pages | 35 |
| Journal | Mathematical Programming |
| Volume | 102 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Mar 2005 |
| Externally published | Yes |
Keywords
- Branch and cut
- Hub location
- Polyhedral analysis