Solving the hub location problem in a star-star network
dc.citation.epage | 33 | en_US |
dc.citation.issueNumber | 1 | en_US |
dc.citation.spage | 19 | en_US |
dc.citation.volumeNumber | 51 | en_US |
dc.contributor.author | Labbé, M. | en_US |
dc.contributor.author | Yaman, H. | en_US |
dc.date.accessioned | 2016-02-08T10:10:41Z | |
dc.date.available | 2016-02-08T10:10:41Z | |
dc.date.issued | 2008 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description.abstract | We consider the problem of locating hubs and assigning terminals to hubs for a telecommunication network. The hubs are directly connected to a central node and each terminal node is directly connected to a hub node. The aim is to minimize the cost of locating hubs, assigning terminals and routing the traffic between hubs and the central node. We present two formulations and show that the constraints are facet-defining inequalities in both cases. We test the formulations on a set of instances. Finally, we present a heuristic based on Lagrangian relaxation. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T10:10:41Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2008 | en |
dc.identifier.doi | 10.1002/net.20193 | en_US |
dc.identifier.eissn | 1097-0037 | |
dc.identifier.issn | 0028-3045 | |
dc.identifier.uri | http://hdl.handle.net/11693/23239 | |
dc.language.iso | English | en_US |
dc.publisher | John Wiley & Sons | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1002/net.20193 | en_US |
dc.source.title | Networks | en_US |
dc.subject | Hub location | en_US |
dc.subject | Star–star network | en_US |
dc.subject | Polyhedral analysis | en_US |
dc.subject | Branch and cut | en_US |
dc.subject | Lagrangian relaxation | en_US |
dc.title | Solving the hub location problem in a star-star network | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Solving_the_hub_location_problem_in_a_star-star_network.pdf
- Size:
- 273.46 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version