Solving the hub location problem in a star-star network

dc.citation.epage33en_US
dc.citation.issueNumber1en_US
dc.citation.spage19en_US
dc.citation.volumeNumber51en_US
dc.contributor.authorLabbé, M.en_US
dc.contributor.authorYaman, H.en_US
dc.date.accessioned2016-02-08T10:10:41Z
dc.date.available2016-02-08T10:10:41Z
dc.date.issued2008en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe 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.provenanceMade 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: 2008en
dc.identifier.doi10.1002/net.20193en_US
dc.identifier.eissn1097-0037
dc.identifier.issn0028-3045
dc.identifier.urihttp://hdl.handle.net/11693/23239
dc.language.isoEnglishen_US
dc.publisherJohn Wiley & Sonsen_US
dc.relation.isversionofhttp://dx.doi.org/10.1002/net.20193en_US
dc.source.titleNetworksen_US
dc.subjectHub locationen_US
dc.subjectStar–star networken_US
dc.subjectPolyhedral analysisen_US
dc.subjectBranch and cuten_US
dc.subjectLagrangian relaxationen_US
dc.titleSolving the hub location problem in a star-star networken_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
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