Design of Survivable Networks: A survey
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 795223
- Design of survivable IP-over-optical networks
- scientific article; zbMATH DE number 176255
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Polyhedral approaches to the design of survivable networks
Cites work
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Design of survivable networks
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- scientific article; zbMATH DE number 1342128 (Why is no real title available?)
- scientific article; zbMATH DE number 1535630 (Why is no real title available?)
- scientific article; zbMATH DE number 910889 (Why is no real title available?)
- scientific article; zbMATH DE number 2196281 (Why is no real title available?)
- Quantum private communication
- TSPLIB—A Traveling Salesman Problem Library
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
Cited in
(93)- Topological design of survivable mesh-based transport networks
- Branch-and-cut methods for the network design problem with vulnerability constraints
- Design of survivable networks with vulnerability constraints
- Bilevel model for adaptive network flow problem
- A hybrid optimization approach for the Steiner k-connected network design problem
- Formulations for designing robust networks. An application to wind power collection
- Stochastic survivable network design problems: theory and practice
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Solving the optimum communication spanning tree problem
- Optimization algorithms for resilient path selection in networks
- On superperfection of edge intersection graphs of paths
- A Lagrangian dual method for two-stage robust optimization with binary uncertainties
- Placing Green bridges optimally, with a multivariate analysis
- Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane
- On the chance-constrained minimum spanning \(k\)-core problem
- Reliability problems in multiple path-shaped facility location on networks
- The two-level diameter constrained spanning tree problem
- Design and dimensioning of hydrogen transmission pipeline networks
- A global optimization algorithm for reliable network design
- Multiobjective design of survivable IP networks
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- Network design and defence
- Unreliable point facility location problems on networks
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions
- Optimal capacitated ring trees
- Strong lower bounds for a survivable network design problem
- Circular and radial design comparison of survivability in asymmetrical hierarchical networks
- Survivability in hierarchical telecommunications networks
- Survivability in hierarchical telecommunications networks under dual homing
- A metaheuristic for security budget allocation in utility networks
- Incremental network design with shortest paths
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Survivable network design with shared-protection routing
- Incremental network design with minimum spanning trees
- A branch-and-cut algorithm for the k-edge connected subgraph problem
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- Finding totally independent spanning trees with linear integer programming
- Energy-aware survivable networks
- Hierarchical survivable network design problems
- On the hop-constrained survivable network design problem with reliable edges
- A branch-and-cut algorithm for two-level survivable network design problems
- On the Steiner 2-edge connected subgraph polytope
- Price of Stability in Survivable Network Design
- scientific article; zbMATH DE number 1184420 (Why is no real title available?)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
- Solving survivable two-layer network design problems by metric inequalities
- The k edge-disjoint 3-hop-constrained paths polytope
- scientific article; zbMATH DE number 1757974 (Why is no real title available?)
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- scientific article; zbMATH DE number 795223 (Why is no real title available?)
- Online and Stochastic Survivable Network Design
- A decomposition algorithm for the ring spur assignment problem
- Fractional routing using pairs of failure-disjoint paths
- A formulation for a hop constrained survivable network design problem
- Parameterized approximation algorithms for bidirected Steiner network problems
- Optimal design and defense of networks under link attacks
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- Connectivity Upgrade Models for Survivable Network Design
- A network design problem with two-edge matching failures
- Hop-level flow formulation for the survivable network design with hop constraints problem
- Minimum-weight subgraphs with unicyclic components and a lower-bounded girth
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- A generic optimization framework for resilient systems
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Using a hybrid of exact and genetic algorithms to design survivable networks
- Design of survivable wireless backhaul networks with reliability considerations
- An exact approach for the reliable fixed-charge location problem with capacity constraints
- Valid inequalities and facets for multi‐module survivable network design problem
- Robust capacitated Steiner trees and networks with uniform demands
- Capacity-preserving subgraphs of directed flow networks
- A survivable variant of the ring star problem
- Network design with vulnerability constraints and probabilistic edge reliability
- The parameterized complexity of the survivable network design problem
- A computational study on integer programming formulations for hop-constrained survivable network design
- Design of survivable networks with low connectivity requirements
- Cooperative cross-entropy method for generating entangled networks
- On non-superperfection of edge intersection graphs of paths
- Complexity of the virtual network embedding with uniform demands
- Survivable two-fault-tolerant ring star problem
- A resilient variant of the ring star problem
- A new approach for approximating directed rooted networks
- Monte Carlo safeguarding of key links through multiple random walks in large network
- Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
- Survivable network design with group-to-group requirement
- Distributed observer-based fault detection over intelligent networked multi-vehicle systems
- Designing survivable networks with zero-suppressed binary decision diagrams
- Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron
- The k-path tree matroid and its applications to survivable network design
This page was built for publication: Design of Survivable Networks: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5318274)
