A Decomposition Algorithm for the Ring Spur Assignment Problem

Files in This Item:
File Description SizeFormat 
paula_carroll_ITOR_July_2012.pdf291.25 kBAdobe PDFDownload
Title: A Decomposition Algorithm for the Ring Spur Assignment Problem
Authors: Carroll, Paula
McGarraghy, 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
Appears in Collections:Business Research Collection

Show full item record

Citations 50

Last Week
Last month
checked on Feb 12, 2019

Google ScholarTM



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.