More facets for survivable networks

In this article, we analyze ‘the survivable cutset,’ a basic polyhedron related to most models describing survivable networks. Its importance stems from the fact that it is the analogous of the cutset inequality for survivable networks and cutset inequalities have proved fundamental for solving networks problems via cutting‐plane algorithms. We are able to characterize completely the ‘survivable cutset’ via its extreme points, and we describe some important classes of its facets. We prove also that the separation problem is polynomial in the size of the cutset.