Connectivity-splitting models for survivable network design
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1058029
- scientific article; zbMATH DE number 3871399
- scientific article; zbMATH DE number 2009870
- Connectivity Upgrade Models for Survivable Network Design
- Design of survivable networks with vulnerability constraints
- Design of survivable networks
- scientific article; zbMATH DE number 795223
- Design of communication networks with survivability constraints
Cited in
(14)- Hop-constrained node survivable network design: An application to MPLS over WDM
- Stochastic survivable network design problems: theory and practice
- A global optimization algorithm for reliable network design
- A bilevel mixed-integer program for critical infrastructure protection planning
- Minimum cost k edges connected subgraph problems
- Strong lower bounds for a survivable network design problem
- scientific article; zbMATH DE number 1086920 (Why is no real title available?)
- Strong formulations for network design problems with connectivity requirements
- Connectivity Upgrade Models for Survivable Network Design
- A graph theory approach for designing conservation reserve networks with minimal fragmentation
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
- Survivable two-fault-tolerant ring star problem
- The k-path tree matroid and its applications to survivable network design
- Partition inequalities for capacitated survivable network design based on directed p-cycles
This page was built for publication: Connectivity-splitting models for survivable network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4446914)