The University of Southampton
University of Southampton Institutional Repository

The Ring Spur Assignment Problem: New formulation, valid inequalities and a branch-and-cut approach

The Ring Spur Assignment Problem: New formulation, valid inequalities and a branch-and-cut approach
The Ring Spur Assignment Problem: New formulation, valid inequalities and a branch-and-cut approach
A new mathematical model is proposed for the Ring Spur Assignment Problem (RSAP) that arises in the design of next-generation telecommunication networks. In this problem, every node of the network lies either on a ring among a set of bounded disjoint local rings or is spurred by a single arc to another node on a local ring. A special ring, called a tertiary ring, interconnects the local rings. Our new integer programming model employs only variables and has a stronger LP relaxation. Several classes of valid inequalities and corresponding separation procedures are presented giving rise to an efficient branch-and-cut solution algorithm. We report optimal solutions for all SNDLib instances including those that have not previously been solved to optimality.
0305-0548
Neamatian Monemi, Rahimeh
b18838f0-854b-4c2c-9100-c50c531e5666
Gelareh, Shanin
29aea16e-cfc0-4dfd-8043-2bf10ff35e8c
Neamatian Monemi, Rahimeh
b18838f0-854b-4c2c-9100-c50c531e5666
Gelareh, Shanin
29aea16e-cfc0-4dfd-8043-2bf10ff35e8c

Neamatian Monemi, Rahimeh and Gelareh, Shanin (2017) The Ring Spur Assignment Problem: New formulation, valid inequalities and a branch-and-cut approach. Computers & Operations Research, 88. (doi:10.1016/j.cor.2017.06.016).

Record type: Article

Abstract

A new mathematical model is proposed for the Ring Spur Assignment Problem (RSAP) that arises in the design of next-generation telecommunication networks. In this problem, every node of the network lies either on a ring among a set of bounded disjoint local rings or is spurred by a single arc to another node on a local ring. A special ring, called a tertiary ring, interconnects the local rings. Our new integer programming model employs only variables and has a stronger LP relaxation. Several classes of valid inequalities and corresponding separation procedures are presented giving rise to an efficient branch-and-cut solution algorithm. We report optimal solutions for all SNDLib instances including those that have not previously been solved to optimality.

Text
RSAP-Rahimeh Neamatian Monemi - Accepted Manuscript
Download (415kB)

More information

Accepted/In Press date: 20 June 2017
e-pub ahead of print date: 22 June 2017
Published date: December 2017

Identifiers

Local EPrints ID: 412526
URI: https://eprints.soton.ac.uk/id/eprint/412526
ISSN: 0305-0548
PURE UUID: 40c6d6be-492f-425a-89df-a6093a670782

Catalogue record

Date deposited: 20 Jul 2017 16:30
Last modified: 20 Jul 2019 04:58

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×