Design of survivable networks with low connectivity requirements

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
An approximation algorithm for minimum-cost vertex-connectivity problems
Survivable networks, linear programming relaxations and the parsimonious property
A factor 2 approximation algorithm for the generalized Steiner network problem
Steiner problem in Halin networks
Separating from the dominant of the spanning tree polytope
Design of survivable networks
On the linear relaxation of the 2-node connected subgraph polytope
Two-edge connected spanning subgraphs and polyhedra
Zur allgemeinen Kurventheorie.
Design of survivable networks with vulnerability constraints
On survivable network polyhedra
Separation of partition inequalities for the \((1,2)\)-survivable network design problem
Steiner \(k\)-edge connected subgraph polyhedra
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
\(k\)-edge connected polyhedra on series-parallel graphs
Separation of partition inequalities
Survivability in hierarchical telecommunications networks
A GRASP algorithm for a capacitated, fixed charge, multicommodity network flow problem with uncertain demand and survivability constraints
A branch-and-cut algorithm for the k-edge connected subgraph problem
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
Very Simple Methods for All Pairs Network Flow Analysis
On the Steiner 2-edge connected subgraph polytope
On the Polytope of the (1,2)-Survivable Network Design Problem
Generalized steiner problem in series-parallel networks
Optimal attack and reinforcement of a network
Steiner problem in networks: A survey
Multi-Terminal Network Flows
Linear-time computability of combinatorial problems on series-parallel graphs
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
TSPLIB—A Traveling Salesman Problem Library
Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
The k-Edge-Connected Spanning Subgraph Polyhedron
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
Low-connectivity network design on series-parallel graphs
Two node-disjoint hop-constrained survivable network design and polyhedra
Design of Survivable Networks: A survey
A new formulation for the liner shipping network design problem
On hub location problems in geographically flexible networks
The strong network orientation problem
Wildlife reserve design with connectivity and buffer requirements

This page was built for publication: Design of survivable networks with low connectivity requirements