On the dominant of the Steiner 2-edge connected subgraph polytope

AbstractGiven a graph G=(V,E) with weights on its edges and a set of specified nodes S⊆V, the Steiner 2-edge connected subgraph problem is to find a minimum weight 2-edge connected subgraph of G, spanning S. This problem has applications to the design of reliable communication and transportation networks. In this paper we give a complete linear description of the dominant of the associated polytope in a class of graphs called perfectly Steiner 2-edge connected graphs, which contains series–parallel graphs. We also discuss related polyhedra