Survivability in Hierarchical Telecommunications Networks Under Dual Homing

DOI10.1287/ijoc.1120.0541zbMath1356.90033OpenAlexW2154104243MaRDI QIDQ2967611

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

Publication date: 1 March 2017

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

branch and cutfacetshierarchical network designvariable fixingdual-homing survivabilitytwo-edge connectedness

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Related Items

A multi-commodity flow based model for multi layer hierarchical ring network design, A branch-and-cut algorithm for two-level survivable network design problems, A survivable variant of the ring star problem

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Design of survivable networks
• Two-edge connected spanning subgraphs and polyhedra
• A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach
• On survivable network polyhedra
• The 2-edge-connected subgraph polyhedron
• Designing Hierarchical Survivable Networks
• Survivability in hierarchical telecommunications networks
• On the Steiner 2-edge connected subgraph polytope
• TSPLIB—A Traveling Salesman Problem Library
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Strong formulations for network design problems with connectivity requirements
• Connectivity Upgrade Models for Survivable Network Design
• Design of Survivable Networks: A survey