Show simple item record

dc.contributor.authorCabral, E. A.en_US
dc.contributor.authorErkut, E.en_US
dc.contributor.authorLaporte, G.en_US
dc.contributor.authorPatterson, R.en_US
dc.date.accessioned2015/07/28en_US
dc.date.accessioned2015-07-28T11:58:10Z
dc.date.available2015-07-28T11:58:10Z
dc.date.issued2007-07-16en_US
dc.identifier.citationCabral, E. A., Erkut, E., Laporte, G., & Patterson, R. A. (2007). The network design problem with relays. European Journal of Operational Research, 180(2), 834-844.en_US
dc.identifier.issn0377-2217en_US
dc.identifier.urihttp://hdl.handle.net/11693/11600
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractThe network design problem with relays (NDPR) is defined on an undirected graph G = (V,E,K), where V = {1,...,n} is a vertex set, E = {(i,j):i,j 2 V,i < j} is an edge set. The set K = {(o(k),d(k))} is a set of communication pairs (or commodities): o(k) 2 V and d(k) 2 V denote the origin and the destination of the kth commodity, respectively. With each edge (i,j) are associated a cost cij and a length dij. With vertex i is associated a fixed cost fi of locating a relay at i. The NDPR consists of selecting a subset E of edges of E and of locating relays at a subset V of vertices of V in such a way that: (1) the sum Q of edge costs and relay costs is minimized; (2) there exists a path linking the origin and the destination of each commodity in which the length between the origin and the first relay, the last relay and the destination, or any two consecutive relays does not exceed a preset upper bound k. This article develops a lower bound procedure and four heuristics for the NPDR. These are compared on several randomly generated instances with |V| 6 1002 and |E| 6 1930. 2006 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.source.titleEuropean Journal of Operational Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.ejor.2006.04.030en_US
dc.rightsCopyright © 2006 Elsevier B.V.en_US
dc.subjectNetwork Designen_US
dc.subjectTelecommunicationsen_US
dc.subjectColumn Generationen_US
dc.subjectHeuristicen_US
dc.titleThe Network Design Problem with Relaysen_US
dc.typeResearch Paperen_US
dc.departmentDepartment of Managementen_US
dc.citation.spage834en_US
dc.citation.epage844en_US
dc.citation.volumeNumber180en_US
dc.citation.issueNumber2en_US
dc.identifier.doi10.1016/j.ejor.2006.04.030en_US
dc.publisherElsevieren_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record