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

https://doi.org/10.1016/S0166-218X(00)00306-1Get rights and content
Under an Elsevier user license
open archive

Abstract

Given 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.

Keywords

Perfectly Steiner 2-edge connected graph
Polytope
Dominant

Cited by (0)

☆

Supported by FONDAP Matematicas Aplicadas Universidad de Chile, Departamento de Ingenieria Matematica. Part of this work was done when the author was in Ecole Polytechnique, Laboratoire d'Econométrie, 1 rue Descartes, 75005 Paris, France.

Copyright © 2001 Elsevier Science B.V. All rights reserved.