The following pages link to Design of survivable networks (Q1202193):
Displaying 46 items.
- Optimal capacitated ring trees (Q286687) (← links)
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- Survivable network design with demand uncertainty (Q631096) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- Designing survivable networks with zero-suppressed binary decision diagrams (Q782194) (← links)
- Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron (Q839668) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243) (← links)
- Hop-constrained node survivable network design: An application to MPLS over WDM (Q1035728) (← links)
- New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
- Topological design of survivable mesh-based transport networks (Q1599302) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- Polyhedral results for two-connected networks with bounded rings (Q1849257) (← links)
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
- Multiobjective design of survivable IP networks (Q2379874) (← links)
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319) (← links)
- The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819) (← links)
- Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- Circular and radial design comparison of survivability in asymmetrical hierarchical networks (Q2885521) (← links)
- Survivability in hierarchical telecommunications networks (Q2892145) (← links)
- Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
- On the complexity of resilient network design (Q3057137) (← links)
- Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
- On the Generalized Steiner Problem with Network Reliability Conditions (Q3439546) (← links)
- Price of Stability in Survivable Network Design (Q3648856) (← links)
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134) (← links)
- Connectivity-splitting models for survivable network design (Q4446914) (← links)
- Strong formulations for network design problems with connectivity requirements (Q4667715) (← links)
- Some recent contributions to network optimization (Q4812397) (← links)
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements (Q4887724) (← links)
- Online and Stochastic Survivable Network Design (Q4910579) (← links)
- The capacitated m two node survivable star problem (Q4987700) (← links)
- A formulation for a hop constrained survivable network design problem (Q4987706) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- Connectivity Upgrade Models for Survivable Network Design (Q5188992) (← links)
- Design of Survivable Networks Using Three- and Four-Partition Facets (Q5301121) (← links)
- Design of Survivable Networks: A survey (Q5318274) (← links)
- Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) (← links)
- On the dominant of the Steiner 2-edge connected subgraph polytope (Q5946813) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- On the reliability estimation of stochastic binary systems (Q6071090) (← links)
- A polyhedral approach to planar augmentation and related problems (Q6102325) (← links)
- Network design with vulnerability constraints and probabilistic edge reliability (Q6599059) (← links)
- Design of survivable networks with low connectivity requirements (Q6659118) (← links)
