Abstract. In this paper, we study the Steiner 2-edge connected sub- graph polytope. We introduce a large class of valid inequalities for.

In this paper, we study the Steiner 2 -edge connected subgraph polytope. We introduce a large class of valid inequalities for this polytope called the ...

Sep 15, 2001 · This paper gives a complete description of the dominant of the polytope associated with the STECSP in the class of perfectly Steiner 2-edge ...

In this paper, we study the Steiner 2-edge connected subgraph polytope. We introduce a large class of valid inequalities for this polytope called the ...

Abstract. Given a graph G = (V, E) with weights on its edges and a set of specified nodes. S ⊆ V , the Steiner 2-edge survivable network problem is to find ...

In this paper, we study the Steiner 2 -edge connected subgraph polytope.We introduce a large class of valid inequalities for this polytope calledthe ...

In this paper, we study the Steiner 2-edge connected subgraph polytope. We introduce a large class of valid inequalities for this polytope called ...

Given a graph G=(V,E) with weights on its edges and a set of specified nodes S ⊆ V , the Steiner 2-edge survivable network problem is to find a minimum ...

This problem has applications to the design of reliable communication and transportation networks. In this paper, we give a complete linear description of the ...

On the Steiner 2-edge connected subgraph polytope. A. Rhida Mahjoub, RAIRO - Operations Research-1, 2005. The st-bond polytope on series-parallel graphs.