Survivability in hierarchical telecommunications networks

DOI10.1002/net.20479zbMath1241.90023OpenAlexW2158615889MaRDI QIDQ2892145

Onur Özkök, Hande Yaman, Oya Ekin Karaşan, Ali Ridha Mahjoub, Pierre Fouilhoux

Publication date: 18 June 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/21651

zbMATH Keywords

separationbranch-and-cutsurvivabilityfacethierarchical networkreduction operation

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Linear programming (90C05)

Related Items

Exact algorithms for budgeted prize-collecting covering subgraph problems, A branch-and-cut algorithm for two-level survivable network design problems, Time constrained maximal covering salesman problem with weighted demands and partial coverage, A survivable variant of the ring star problem, Survivability in Hierarchical Telecommunications Networks Under Dual Homing

Uses Software

• TSPLIB

Cites Work

• The hierarchical network design problem with transshipment facilities
• Locating concentrators in centralized computer networks
• Upper and lower bounds for the two-level simple plant location problem
• Two-edge connected spanning subgraphs and polyhedra
• On perfectly two-edge connected graphs
• A branch and cut algorithm for hub location problems with single assignment
• On survivable network polyhedra
• Polyhedral results for two-connected networks with bounded rings
• On two-connected subgraph polytopes
• On the \(k\) edge-disjoint 2-hop-constrained paths polytope
• The 2-edge-connected subgraph polyhedron
• Critical extreme points of the 2-edge connected spanning subgraph polytope
• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
• A branch-and-cut algorithm for the k-edge connected subgraph problem
• A new approach to the maximum-flow problem
• Topological design of centralized computer networks—formulations and algorithms
• TSPLIB—A Traveling Salesman Problem Library
• Set Partitioning: A survey
• A hub location problem in designing digital data service networks: Lagrangian relaxation approach
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Solving the Two-Connected Network with Bounded Meshes Problem
• Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
• Design of Survivable Networks: A survey
• Solving the hub location problem in a star–star network