The Steiner tree polytope and related polyhedra

We consider the vertex-weighted version of the undirected Steiner tree problem. In this problem, a cost is incurred both for the vertices and the edges present in the Steiner tree. We completely describe the associated polytope by linear inequalities when the underlying graph is series—parallel. For general graphs, this formulation can be interpreted as a (partial) extended formulation for the Steiner tree problem. By projecting this formulation, we obtain some very large classes of facet-defining valid inequalities for the Steiner tree polytope.

[1]  Detlef Seese,et al.  Problems Easy for Tree-Decomposable Graphs (Extended Abstract) , 1988, ICALP.

[2]  I. Anderson.  Combinatorial Designs: Construction Methods , 1990 .

[3]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[4]  Richard T. Wong,et al.  A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[5]  Arie Segev,et al.  The node-weighted steiner tree problem , 1987, Networks.

[6]  R. Duffin.  Topology of series-parallel networks , 1965 .

[7]  Michel X. Goemans,et al.  Arborescence Polytopes for Series-parallel Graphs , 1994, Discret. Appl. Math..

[8]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[9]  A. R. Mahjoub,et al.  On the stable set polytope of a series-parallel graph , 1988, Math. Program..

[10]  Egon Balas,et al.  The perfectly matchable subgraph polytope of a bipartite graph , 1983, Networks.

[11]  Mouloud Boulala,et al.  Polytope des independants d'un graphe serie-parallele , 1979, Discret. Math..

[12]  A. Volgenant,et al.  Some generalizations of the steiner problem in graphs , 1987, Networks.

[13]  László Lovász,et al.  Graph Theory and Integer Programming , 1979 .

[14]  J. Rhys.  A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[15]  Gérard Cornuéjols,et al.  The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..

[16]  Ali Ridha Mahjoub,et al.  Two-edge connected spanning subgraphs and polyhedra , 1994, Math. Program..

[17]  M. Schaffers.  A polynomial algorithm for the single source network flow design problem on series-parallel graphs , 1990 .

[18]  M. R. Rao,et al.  The Steiner tree problem II: Properties and classes of facets , 1994, Math. Program..

[19]  Charles J. Colbourn,et al.  Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.

[20]  M. R. Rao,et al.  The Steiner tree problem I: Formulations, compositions and extension of facets , 1994, Math. Program..

[21]  Michel X. Goemans,et al.  A catalog of steiner tree formulations , 1993, Networks.

[22]  Donald K. Wagner.  Forbidden subgraphs and graph decomposition , 1987, Networks.

[23]  Ronald L. Rardin,et al.  Polyhedral Characterization of Discrete Dynamic Programming , 1990, Oper. Res..

[24]  Pawel Winter,et al.  Generalized Steiner Problem in Series-Parallel Networks , 1986, J. Algorithms.