A Decomposition Algorithm for the Ring Spur Assignment Problem

Files in This Item:
 File SizeFormat
Downloadpaula_carroll_ITOR_July_2012.pdf291.25 kBAdobe PDF
Title: A Decomposition Algorithm for the Ring Spur Assignment Problem
Authors: Carroll, PaulaMcGarraghy, Sean
Permanent link: http://hdl.handle.net/10197/9283
Date: Jan-2013
Online since: 2018-03-13T15:08:05Z
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.
Type of material: Journal Article
Publisher: Wiley
Journal: International Transactions in Operational Research
Volume: 20
Issue: 1
Start page: 119
End page: 139
Copyright (published version): 2012 the Authors
Keywords: NetworksGraphsApplicationsCombinatoricsInteger programming formulationTelecommunications network topology designCutting plane algorithm
DOI: 10.1111/j.1475-3995.2012.00867.x
Language: en
Status of Item: Peer reviewed
This item is made available under a Creative Commons License: https://creativecommons.org/licenses/by-nc-nd/3.0/ie/
Appears in Collections:Business Research Collection

Show full item record

Citations 50

Last Week
Last month
checked on Sep 12, 2020

Page view(s)

Last Week
Last month
checked on Aug 20, 2022

Download(s) 50

checked on Aug 20, 2022

Google ScholarTM



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.