Strong inequalities for capacitated survivable network design problems

We present several classes of facet-defining inequalities to strengthen polyhedra arising as subsystems of network design problems with survivability constraints. These problems typically involve assigning capacities to a network with multicommodity demands, such that after a vertex- or edge-deletion at least some prescribed fraction of each demand can be routed. Received: December 1997 / Accepted: April 2000?Published online September 20, 2000