A decomposition algorithm for the ring spur assignment problem

DOI10.1111/j.1475-3995.2012.00867.xzbMath1263.90036OpenAlexW2091262442MaRDI QIDQ4921258

Paula Carroll, Seán McGarraghy

Publication date: 23 May 2013

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10197/9283

zbMATH Keywords

combinatoricsnetworksapplicationsgraphscutting plane algorithminteger programming formulationtelecommunications network topology design

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (3)

Hierarchical survivable network design problems ⋮ The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach ⋮ A branch-and-cut algorithm for two-level survivable network design problems

Uses Software

• SNDlib
• SONET

Cites Work

• A heuristic procedure for the capacitated \(m\)-ring-star problem
• SONET/SDH ring assignment with capacity constraints
• A tabu search algorithm for self-healing ring network design.
• Two-connected networks with rings of bounded cardinality
• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
• A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem
• The Capacitated m-Ring-Star Problem
• Odd Minimum Cut-Sets and b-Matchings
• A simple min-cut algorithm
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Solving the Two-Connected Network with Bounded Meshes Problem
• Advances in optical networking
• Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
• Future high-capacity optical telecommunication networks
• Design of Survivable Networks: A survey
• A column generation approach for SONET ring assignment

This page was built for publication: A decomposition algorithm for the ring spur assignment problem