Solving the hub location problem with modular link capacities

dc.citation.epage3245en_US
dc.citation.issueNumber12en_US
dc.citation.spage3227en_US
dc.citation.volumeNumber32en_US
dc.contributor.authorYaman, H.en_US
dc.contributor.authorCarello, G.en_US
dc.date.accessioned2016-02-08T10:21:45Z
dc.date.available2016-02-08T10:21:45Z
dc.date.issued2005en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractThis paper deals with a capacitated hub location problem arising in the design of telecommunications networks. The problem is different from the classical hub location problem in two ways: the cost of using an edge is not linear but stepwise and the capacity of a hub restricts the amount of traffic transiting through the hub rather than the incoming traffic. In this paper both an exact and a heuristic method are presented. They are compared and combined in a heuristic concentration approach to investigate whether it is possible to improve the results within limited computational times.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:21:45Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2005en
dc.identifier.doi10.1016/j.cor.2004.05.009en_US
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/23953
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2004.05.009en_US
dc.source.titleComputers and Operations Researchen_US
dc.subjectBranch and cuten_US
dc.subjectHeuristic concentrationen_US
dc.subjectHub locationen_US
dc.subjectTabu searchen_US
dc.titleSolving the hub location problem with modular link capacitiesen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Solving_the_hub_location_problem_with_modular_link_capacities.pdf
Size:
234.98 KB
Format:
Adobe Portable Document Format
Description:
Full printable version