Survivable network design with shared-protection routing
DOI10.1016/J.EJOR.2014.04.047zbMATH Open1338.90093OpenAlexW2045115150MaRDI QIDQ296897FDOQ296897
Authors: Y. K. Agarwal, Prahalad Venkateshan 
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.047
Recommendations
- scientific article; zbMATH DE number 795223
- Hop constrained network design problem with partial survivability
- Large scale linear programs and heuristics for the design of survivable telecommunication networks
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
- Design of Survivable Networks: A survey
large scale optimizationcolumn generationend-to-end restoration schemesshared protection survivable network design
Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11) Communication networks in operations research (90B18)
Cites Work
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- The convex hull of two core capacitated network design problems
- On capacitated network design cut-set polyhedra
- k-Partition-based facets of the network design problem
- Metric inequalities and the network loading problem
- Using mixed-integer programming to solve power grid blackout problems
- The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
- Complexity of column generation in network design with path-based survivability mechanisms
- Polyhedral structure of the 4-node network design problem
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Solving survivable two-layer network design problems by metric inequalities
- Title not available (Why is that?)
- Connectivity Upgrade Models for Survivable Network Design
- Design of survivable networks using three- and four-partition facets
- Minimum-weight two-connected spanning networks
- Strong inequalities for capacitated survivable network design problems.
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
Cited In (14)
- A branch and bound algorithm for primary routes assignment in survivable connection oriented networks
- Heuristic algorithms for designing self-repairing protection trees in mesh networks
- Large scale linear programs and heuristics for the design of survivable telecommunication networks
- Fast heuristics for protection networks for dynamic routing
- Combinatorial optimization in networks with shared risk link groups
- Multiobjective design of survivable IP networks
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
- A bootstrap heuristic for designing minimum cost survivable networks
- Near optimal design of wavelength routed optical networks
- Energy-aware survivable networks
- A survivable DoS-resistant overlay network
- Title not available (Why is that?)
- Survivable green traffic engineering with shared protection
- SRG-disjoint design with dedicated and shared protection
Uses Software
This page was built for publication: Survivable network design with shared-protection routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296897)
