Show simple item record

dc.contributor.authorYaman, H.en_US
dc.date.accessioned2016-02-08T10:08:00Z
dc.date.available2016-02-08T10:08:00Z
dc.date.issued2008en_US
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/23027
dc.description.abstractWe consider the hub location problem, where p hubs are chosen from a given set of nodes, each nonhub node is connected to exactly one hub and each hub is connected to a central hub. Links are installed on the arcs of the resulting network to route the traffic. The aim is to find the hub locations and the connections to minimize the link installation cost. We propose two formulations and a heuristic algorithm to solve this problem. The heuristic is based on Lagrangian relaxation and local search. We present computational results where formulations are compared and the quality of the heuristic solutions are tested.en_US
dc.language.isoEnglishen_US
dc.source.titleComputers & Operations Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2007.01.014en_US
dc.subjectHub locationen_US
dc.subjectP-Hub medianen_US
dc.subjectStar–star networken_US
dc.subjectLagrangian relaxationen_US
dc.subjectLocal searchen_US
dc.titleStar p-hub median problem with modular arc capacitiesen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage3009en_US
dc.citation.epage3019en_US
dc.citation.volumeNumber35en_US
dc.citation.issueNumber9en_US
dc.identifier.doi10.1016/j.cor.2007.01.014en_US
dc.publisherElsevieren_US
dc.identifier.eissn1873-765X


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record