A Decomposition Algorithm for the Ring Spur Assignment Problem

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Carroll, Paula
dc.contributor.author McGarraghy, Sean
dc.date.accessioned 2018-03-13T15:08:05Z
dc.date.available 2018-03-13T15:08:05Z
dc.date.copyright 2012 the Authors en
dc.date.issued 2013-01
dc.identifier.citation International Transactions in Operational Research en
dc.identifier.uri http://hdl.handle.net/10197/9283
dc.description.abstract This paper describes the ring spur assignment problem (RSAP), a new problem arising in the design of next generation networks. The RSAP complements the sonet ring assignment problem (SRAP). We describe the RSAP, positioning it in relation to problems previously addressed in the literature. We decompose the problem into two IP problems and describe a branch-and-cut decomposition heuristic algorithm suitable for solving problem instances in a reasonable time. We present promising computational results. en
dc.language.iso en en
dc.publisher Wiley en
dc.rights This is the author's version of the following article: Carroll, P., McGarraghy, S. (2012) A decomposition algorithm for the ring spur assignment problem, International Transactions on Operational Research, 20 (1) :119–139 which has been published in final form at http://dx.doi.org/10.1111/j.1475-3995.2012.00867.x en
dc.subject Networks en
dc.subject Graphs en
dc.subject Applications en
dc.subject Combinatorics en
dc.subject Integer programming formulation en
dc.subject Telecommunications network topology design en
dc.subject Cutting plane algorithm en
dc.title A Decomposition Algorithm for the Ring Spur Assignment Problem en
dc.type Journal Article en
dc.internal.authorcontactother paula.carroll@ucd.ie
dc.status Peer reviewed en
dc.identifier.volume 20 en
dc.identifier.issue 1 en
dc.identifier.startpage 119 en
dc.identifier.endpage 139 en
dc.identifier.doi 10.1111/j.1475-3995.2012.00867.x
dc.neeo.contributor Carroll|Paula|aut|
dc.neeo.contributor McGarraghy|Sean|aut|
dc.internal.rmsid 296378394
dc.date.updated 2017-07-21T14:36:42Z

This item appears in the following Collection(s)

Show simple item record

This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.

If you are a publisher or author and have copyright concerns for any item, please email research.repository@ucd.ie and the item will be withdrawn immediately. The author or person responsible for depositing the article will be contacted within one business day.

Search Research Repository

Advanced Search